scientific article; zbMATH DE number 1136103
From MaRDI portal
Publication:4381413
zbMath0897.03054MaRDI QIDQ4381413
Publication date: 19 October 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Models of arithmetic and set theory (03C62)
Related Items (6)
A remark on pseudo proof systems and hard instances of the satisfiability problem ⋮ Circuit lower bounds in bounded arithmetics ⋮ Work for the workers: Advances in engineering mechanics and instruction in France, 1800–1830 ⋮ Feasibly constructive proofs of succinct weak circuit lower bounds ⋮ Polynomial time ultrapowers and the consistency of circuit lower bounds ⋮ Hardness magnification near state-of-the-art lower bounds
This page was built for publication:
