scientific article; zbMATH DE number 2201364
From MaRDI portal
Publication:5313792
zbMATH Open1098.03046MaRDI QIDQ5313792FDOQ5313792
Authors: Cristian Grozea 
Publication date: 1 September 2005
Title of this publication is not available (Why is that?)
Recommendations
- NP-completeness notions under strong hypotheses
- Grzegorczyk's hierarchy of computable analysis
- The Lambek-Grishin Calculus Is NP-Complete
- Separating NP-completeness notions under strong hypotheses
- On the complexity of computation of rudimentary predicates
- Verifiable Computation and Succinct Arguments for NP
- scientific article; zbMATH DE number 1088223
- Predicate characterizations in the polynomial-size hierarchy
- A recursion-theoretic approach to NP
- Characterising polynomial time computable functions using theories with weak set existence principles
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5313792)
