Computational Complexity Via Finite Types
From MaRDI portal
Publication:2946764
DOI10.1145/2764906zbMath1354.68091OpenAlexW2199053348MaRDI QIDQ2946764
Publication date: 17 September 2015
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2764906
Related Items (1)
Uses Software
Cites Work
- Finite model theory and its applications.
- An abstract framework for environment machines
- Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\)
- Characterizing complexity classes by higher type primitive recursive definitions
- A new recursion-theoretic characterization of the polytime functions
- Characterizing complexity classes by general recursive definitions in higher types
- Light linear logic
- Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity
- Soft linear logic and polynomial time
- Relationships between nondeterministic and deterministic tape complexities
- The expressive power of higher-order types or, life without CONS
- An Implicit Characterization of PSPACE
- Packaging Mathematical Structures
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
- A Modular Formalisation of Finite Group Theory
- Canonical Big Operators
- Alternation
- Tailoring recursion for complexity
- The strength of non-size increasing computation
- The Matita Interactive Theorem Prover
- A concrete framework for environment machines
- A Machine-Checked Proof of the Odd Order Theorem
- Intuitionistic Light Affine Logic
- Guest editorial
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computational Complexity Via Finite Types
