scientific article; zbMATH DE number 863498

MaRDI QIDQ4871777zbMATH OpenFDO

Authors David B. Shmoys, Éva Tardos

Publication date 18 August 1996

zbMATH Keywords

computational complexity theory

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 610968
• scientific article; zbMATH DE number 3936519
• scientific article; zbMATH DE number 3926663
• scientific article; zbMATH DE number 2150283
• scientific article; zbMATH DE number 3810920
• scientific article; zbMATH DE number 218387
• Computational complexity
• scientific article; zbMATH DE number 3888913
• scientific article; zbMATH DE number 3936518
• scientific article; zbMATH DE number 5217263

Cited in

(17)

• On the complexity of some basic problems in computational convexity. I. Containment problems
• Computational complexity of functions
• Computational aspects of relaxation complexity
• Computation and complexity
• Wellness, social networking, and algorithms
• scientific article; zbMATH DE number 403952 (Why is no real title available?)
• Instance complexity
• scientific article; zbMATH DE number 2062231 (Why is no real title available?)
• scientific article; zbMATH DE number 2086606 (Why is no real title available?)
• Computational Sample Complexity
• Structure vs combinatorics in computational complexity
• Reducibility among combinatorial problems
• Computational complexity of compliance and conformance: drawing a line between theory and practice
• Complexity theory
• scientific article; zbMATH DE number 5217263 (Why is no real title available?)
• scientific article; zbMATH DE number 2226428 (Why is no real title available?)
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

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 Q4871777)