An arithmetic for polynomial-time computation
DOI10.1016/J.TCS.2006.03.019zbMATH Open1118.03052OpenAlexW2093877547MaRDI QIDQ2500489FDOQ2500489
Authors: Helmut Schwichtenberg 
Publication date: 16 August 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.03.019
Recommendations
- An arithmetic for non-size-increasing polynomial-time computation
- A weak constructive second-order arithmetic with extraction of algorithms computable in polynomial time
- scientific article; zbMATH DE number 1848310
- A new “feasible” arithmetic
- Extraction and verification of programs by analysis of formal proofs
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) First-order arithmetic and fragments (03F30)
Cites Work
- Bounded arithmetic for NC, ALogTIME, L and NL
- Title not available (Why is that?)
- The realm of primitive recursion
- A new recursion-theoretic characterization of the polytime functions
- Light linear logic
- Higher type recursion, ramification and polynomial time
- Title not available (Why is that?)
- Title not available (Why is that?)
- Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
- Title not available (Why is that?)
- A syntactical analysis of non-size-increasing polynomial time computation
- An arithmetic for non-size-increasing polynomial-time computation
- A new “feasible” arithmetic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Elementary arithmetic
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (10)
- Title not available (Why is that?)
- An abstract approach to stratification in linear logic
- Introduction to clarithmetic. I
- Complexity Analysis by Rewriting
- Extraction and verification of programs by analysis of formal proofs
- Build your own clarithmetic I: Setup and completeness
- Quantum implicit computational complexity
- Correctness, explanation and intention
- A weak constructive second-order arithmetic with extraction of algorithms computable in polynomial time
- An arithmetic for non-size-increasing polynomial-time computation
This page was built for publication: An arithmetic for polynomial-time computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500489)
