scientific article; zbMATH DE number 139642

zbMATH Open0767.94026MaRDI QIDQ4029623FDOQ4029623

Authors: R. G. Nigmatullin 

Publication date: 28 March 1993

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

Recommendations

• scientific article
• scientific article; zbMATH DE number 4087011
• scientific article; zbMATH DE number 4104386
• On a hierarchy of Boolean functions hard to compute in constant depth
• Models of lower-bounds proofs

zbMATH Keywords

lower boundscomplexity theoryBoolean circuitscomputational resourcescombinational complexityBoolean Function

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)

Cited In (18)

• On a hierarchy of Boolean functions hard to compute in constant depth
• Complexity Lower Bounds using Linear Algebra
• Models of lower-bounds proofs
• Title not available (Why is that?)
• A uniform method for proving lower bounds on the computational complexity of logical theories
• Lower bounds for unrestricted Boolean circuits: open problems
• Linear FPT reductions and computational lower bounds
• Title not available (Why is that?)
• A Gödel Theorem on Network Complexity Lower Bounds
• Applications of matrix methods to the theory of lower bounds in computational complexity
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Diagonalization strikes back: some recent lower bounds in complexity theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• A nonlinear lower bound on the practical combinational complexity
• A nonlinear lower bound on the practical combinational complexity

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