The following pages link to (Q4134963):
Displayed 3 items.
- A polynomial-time linear decision tree for the traveling salesman problem and other NP-complete problems (Q1090604) (← links)
- A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem (Q1253918) (← links)
- On the complexity of computations under varying sets of primitives (Q1259164) (← links)