Computer Science Logic
From MaRDI portal
Publication:5311267
DOI10.1007/b100120zbMath1095.03067OpenAlexW2481899496MaRDI QIDQ5311267
Publication date: 22 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b100120
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Second- and higher-order arithmetic and fragments (03F35) Complexity of proofs (03F20)
Related Items (2)
Bounded theories for polyspace computability ⋮ On the complexity of computing winning strategies for finite poset games
This page was built for publication: Computer Science Logic
