scientific article; zbMATH DE number 3562512

zbMath0361.68063MaRDI QIDQ4134963

David P. Dobkin, Richard J. Lipton

Publication date: 1974

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Related Items

A polynomial-time linear decision tree for the traveling salesman problem and other NP-complete problems, A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem, On the complexity of computations under varying sets of primitives