A note on the self-witnessing property of computational problems

DOI10.1007/3-540-61332-3_157zbMath1529.68110OpenAlexW1536078516MaRDI QIDQ6184668

V. Arvind

Publication date: 29 January 2024

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

Full work available at URL: https://doi.org/10.1007/3-540-61332-3_157

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Turing machines that take advice
• Robust algorithms: a different approach to oracles
• A course in constructive algebra
• On search, decision, and the efficiency of polynomial-time algorithms
• Self-reducibility
• Nonconstructive tools for proving polynomial-time decidability
• Designing programs that check their work

This page was built for publication: A note on the self-witnessing property of computational problems