scientific article; zbMATH DE number 3569828

MaRDI QIDQ4140381zbMATH OpenFDO

Authors

Publication date 1976

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Algorithms in computer science (68W99)

Cited in

(6)

• Structure preserving reductions among convex optimization problems
• Toward a unified approach for the classification of NP-complete optimization problems
• The isomorphism conjecture holds and one-way functions exist relative to an oracle
• Inclusion complete tally languages and the Hartmanis-Berman conjecture
• The complexity of computing the permanent
• A note on \(\#\mathcal P\)-completeness of NP-witnessing relations

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