On p-Optimal Proof Systems and Logics for PTIME
From MaRDI portal
Publication:3587449
DOI10.1007/978-3-642-14162-1_27zbMath1288.03031OpenAlexW1712906147MaRDI QIDQ3587449
Publication date: 7 September 2010
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14162-1_27
Complexity of computation (including implicit computational complexity) (03D15) Model theory of finite structures (03C13) Complexity of proofs (03F20)
Related Items
A Parameterized Halting Problem, NEW RELATIONS AND SEPARATIONS OF CONJECTURES ABOUT INCOMPLETENESS IN THE FINITE DOMAIN, Hard Instances of Algorithms and Proof Systems