scientific article; zbMATH DE number 524142

MaRDI QIDQ4284631zbMATH OpenFDO

Authors A. Wigderson

Publication date 13 November 1994

zbMATH Keywords

Boolean circuit complexitycombinatorial covering problemscomplexity classes

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited in

(7)

• Proof complexity in algebraic systems and bounded depth Frege systems with modular counting
• Monotone circuit lower bounds from resolution
• Natural proofs
• Local rainbow colorings for various graphs
• On locally rainbow colourings
• Localizability of the approximation method
• Boolean circuit complexity and two-dimensional cover problems

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