scientific article

DOI10.4230/LIPICS.CSL.2013.296zbMATH Open1356.03100MaRDI QIDQ2958529

Kaveh Ghasemloo, Stephen A. Cook

Publication date: 2 February 2017

Title of this publication is not available (Why is that?)

zbMATH Keywords

bounded arithmeticproof complexitycomputational complexity theory\(\mathrm{AC}^0\)-Frege\(\mathrm{NC}^1\)-Frege

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of proofs (03F20)

Related Items (4)

Title not available (Why is that?) ⋮ Proof complexity in algebraic systems and bounded depth Frege systems with modular counting ⋮ A reduction of proof complexity to computational complexity for 𝐴𝐶⁰[𝑝] Frege systems ⋮ Approximation and Small-Depth Frege Proofs

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