Pages that link to "Item:Q3893331"
From MaRDI portal
The following pages link to On the Polyhedral Decision Problem (Q3893331):
Displaying 14 items.
- Algebraic decision trees and Euler characteristics (Q673780) (← links)
- Lower bound on testing membership to a polyhedron by algebraic decision and computation trees (Q677021) (← links)
- Exponential lower bounds for some NP-complete problems in a restricted linear decision tree model (Q1050255) (← links)
- Lower bounds on probabilistic linear decision trees (Q1067786) (← links)
- Legal coloring of graphs (Q1079578) (← links)
- A polynomial-time linear decision tree for the traveling salesman problem and other NP-complete problems (Q1090604) (← links)
- Comparisons between linear functions can help (Q1170029) (← links)
- Testing the optimality of alphabetic trees (Q1186607) (← links)
- Nearly sharp complexity bounds for multiprocessor algebraic computations (Q1361876) (← links)
- Complexity lower bounds for computation trees with elementary transcendental function gates (Q1365876) (← links)
- Structure of a simple scheduling polyhedron (Q1803611) (← links)
- Decision trees: Old and new results. (Q1854291) (← links)
- On the decisional complexity of problems over the reals (Q1854429) (← links)
- Monotonicity checking (Q3439281) (← links)
