A model theoretic proof of a subexponential time witnessing theorem
From MaRDI portal
Publication:4217552
DOI10.1016/S0764-4442(98)80113-4zbMath0910.03042WikidataQ127629113 ScholiaQ127629113MaRDI QIDQ4217552
Publication date: 11 November 1998
Published in: Comptes Rendus de l'Académie des Sciences - Series I - Mathematics (Search for Journal in Brave)
Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30) Nonstandard models of arithmetic (03H15) Turing machines and related notions (03D10)
Related Items
This page was built for publication: A model theoretic proof of a subexponential time witnessing theorem