Automata, Languages and Programming

DOI10.1007/B99859zbMATH Open1099.68637OpenAlexW2505584480MaRDI QIDQ5466529

Klaus Meer

Publication date: 24 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b99859

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of proofs (03F20)

Recommendations

• Unnamed Item 👍 👎
• Towards NP-P via proof complexity and search 👍 👎
• The PCP theorem for NP over the reals 👍 👎
• Transparent long proofs: A first PCP theorem for \(\text{NP}_{\mathbb R}\) 👍 👎
• The PCP theorem for NP over the reals 👍 👎
• Almost Transparent Short Proofs for NPℝ 👍 👎
• Beyond PNP=NEXP 👍 👎
• Consequences of the provability of NP ⊆ P/poly 👍 👎
• On a transfer theorem for the \(\text{P}\neq \text{NP}\) conjecture 👍 👎
• Verifiable Computation and Succinct Arguments for NP 👍 👎

This page was built for publication: Automata, Languages and Programming