Enumerating error bounded polytime algorithms through arithmetical theories
From MaRDI portal
Cites work
- A higher-order characterization of probabilistic polynomial time
- A linguistic characterization of bounded oracle computation and probabilistic polynomial time
- A new recursion-theoretic characterization of the polytime functions
- An unsolvable problem of elementary number theory.
- Approximate counting in bounded arithmetic
- Arithmetical hierarchy and complexity of computation
- Bounded arithmetic and the polynomial hierarchy
- Bounded linear logic: A modular approach to polynomial-time computability
- Computational Complexity
- Dual weak pigeonhole principle, Boolean complexity, and derandomization
- Existence and feasibility in arithmetic
- Fragments of approximate counting
- Functional interpretations of feasibly constructive arithmetic
- Functionality in combinatory logic.
- Handbook of proof theory
- scientific article; zbMATH DE number 439891 (Why is no real title available?)
- scientific article; zbMATH DE number 4160708 (Why is no real title available?)
- scientific article; zbMATH DE number 4059391 (Why is no real title available?)
- scientific article; zbMATH DE number 3784875 (Why is no real title available?)
- scientific article; zbMATH DE number 176204 (Why is no real title available?)
- scientific article; zbMATH DE number 3474957 (Why is no real title available?)
- scientific article; zbMATH DE number 3557241 (Why is no real title available?)
- scientific article; zbMATH DE number 1254648 (Why is no real title available?)
- scientific article; zbMATH DE number 1144041 (Why is no real title available?)
- scientific article; zbMATH DE number 765034 (Why is no real title available?)
- scientific article; zbMATH DE number 806752 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- scientific article; zbMATH DE number 3305097 (Why is no real title available?)
- scientific article; zbMATH DE number 7724208 (Why is no real title available?)
- Implicit recursion-theoretic characterizations of counting classes
- Lectures on the Curry-Howard isomorphism
- Light linear logic
- Measure quantifier in monadic second order logic
- On computable numbers, with an application to the Entscheidungsproblem.
- On measure quantifiers in first-order arithmetic
- On the Computational Complexity of Algorithms
- Probabilistic Turing Machines and Computability
- Propositional proof systems, the consistency of first order theories and the complexity of computations
- Random resolution refutations
- Randomisation and derandomisation in descriptive complexity theory
- Soft linear logic and polynomial time
- The complexity of theorem-proving procedures
- The measure quantifier
- The prime number theorem and fragments of PA
- The relative efficiency of propositional proof systems
- Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme. I.
This page was built for publication: Enumerating error bounded polytime algorithms through arithmetical theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6856049)
