scientific article; zbMATH DE number 3569828
From MaRDI portal
Publication:4140381
zbMath0365.68045MaRDI QIDQ4140381
No author found.
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Turing machines and related notions (03D10) Algorithms in computer science (68W99)
Related Items
The isomorphism conjecture holds and one-way functions exist relative to an oracle, The complexity of computing the permanent, Structure preserving reductions among convex optimization problems, Toward a unified approach for the classification of NP-complete optimization problems, A note on \(\#\mathcal P\)-completeness of NP-witnessing relations, Inclusion complete tally languages and the Hartmanis-Berman conjecture
