Polynomial time uniformization and non-standard methods

DOI10.1007/BF02127795MaRDI QIDQ1817062zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 1 December 1996

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02127795

zbMATH Keywords

polynomial time computability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 67686
• Nondeterministic polynomial-time computations and models of arithmetic
• scientific article; zbMATH DE number 3904571
• An arithmetic for non-size-increasing polynomial-time computation

Cites work

• scientific article; zbMATH DE number 27666 (Why is no real title available?)
• scientific article; zbMATH DE number 67686 (Why is no real title available?)
• scientific article; zbMATH DE number 3214534 (Why is no real title available?)
• L'arithmétique ouverte et ses modèles non-standards
• Maximal fields with valuations

Cited in

(2)

• Bootstrapping. I
• scientific article; zbMATH DE number 67686 (Why is no real title available?)

This page was built for publication: Polynomial time uniformization and non-standard methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1817062)