Minimal pairs of polynomial degrees with subexponential complexity

DOI10.1016/0304-3975(76)90007-4MaRDI QIDQ1228203zbMATH OpenOpenAlexFDO

Authors Michael Machtey

Publication date 1976

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(76)90007-4

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites work

• scientific article; zbMATH DE number 3480091 (Why is no real title available?)
• scientific article; zbMATH DE number 3566168 (Why is no real title available?)
• On the Computational Complexity of Algorithms
• On the Structure of Polynomial Time Reducibility
• The honest subrecursive classes are a lattice

Cited in

(5)

• Remarks on recursion versus diagonalization and exponentially difficult problems
• On the structure of sets in NP and other complexity classes
• Polynomial and abstract subrecursive classes
• Minimal pairs and complete problems
• Minimal pairs for P

This page was built for publication: Minimal pairs of polynomial degrees with subexponential complexity

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