Publication:4230349
From MaRDI portal
zbMath0977.68556MaRDI QIDQ4230349
Publication date: 21 January 2002
68R10: Graph theory (including graph drawing) in computer science
Related Items
Lower bound on testing membership to a polyhedron by algebraic decision and computation trees, Complexity lower bounds for computation trees with elementary transcendental function gates, A lower bound for randomized algebraic decision trees, Randomization and the computational power of analytic and algebraic decision trees, Decision trees: Old and new results., Lower bounds for arithmetic networks. II: Sum of Betti numbers, Semi-algebraic decision complexity, the real spectrum, and degree, A computationally intractable problem on simplicial complexes, Time and space complexity of deterministic and nondeterministic decision trees