scientific article; zbMATH DE number 1346528

MaRDI QIDQ4266552zbMATH OpenFDO

Authors Eric Allender, Vivek K. Gore

Publication date 3 October 1999

Mathematics Subject Classification ID

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

Cited in

(7)

• Nondeterministic NC^1 computation
• Upper bound for torus polynomials
• Nonuniform ACC circuit lower bounds
• Circuit lower bounds for nondeterministic quasi-polytime from a new easy witness lemma
• Range avoidance, remote point, and hard partial truth table via satisfying-pairs algorithms
• Relations among parallel and sequential computation models
• \#SAT-algorithms for classes of threshold circuits based on probabilistic rank

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