scientific article; zbMATH DE number 1346528
From MaRDI portal
Publication:4266552
zbMath0925.03187MaRDI QIDQ4266552
Vivek K. Gore, Eric W. Allender
Publication date: 3 October 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (5)
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 ⋮ Nondeterministic \(NC^1\) computation ⋮ Upper bound for torus polynomials
This page was built for publication:
