scientific article; zbMATH DE number 2163035

MaRDI QIDQ4673422zbMATH OpenFDO

Authors Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion, Olivier Bournez

Publication date 29 April 2005

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Implicit complexity over an arbitrary structure: Quantifier alternations
• Safe recursion over an arbitrary structure: PAR, PH and DPH
• Tailoring recursion for complexity
• Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time
• scientific article; zbMATH DE number 1956513

Cited in

(12)

• Non-recursive trade-offs are ``almost everywhere
• Implicit complexity over an arbitrary structure: Quantifier alternations
• From determinism, non-determinism and alternation to recursion schemes for P, NP and Pspace (Invited Talk)
• scientific article; zbMATH DE number 4179364 (Why is no real title available?)
• scientific article; zbMATH DE number 4108743 (Why is no real title available?)
• scientific article; zbMATH DE number 1956513 (Why is no real title available?)
• Tailoring recursion for complexity
• Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time
• scientific article; zbMATH DE number 3995649 (Why is no real title available?)
• Safe recursion over an arbitrary structure: PAR, PH and DPH
• scientific article; zbMATH DE number 7301306 (Why is no real title available?)
• scientific article; zbMATH DE number 3895051 (Why is no real title available?)

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 Q4673422)