scientific article; zbMATH DE number 3562512

zbMATH Open0361.68063MaRDI QIDQ4134963FDOQ4134963

Authors: David P. Dobkin, Richard J. Lipton 

Publication date: 1974

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Cited In (3)

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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4134963)