scientific article
From MaRDI portal
Publication:3999199
zbMath0825.68390MaRDI QIDQ3999199
No author found.
Publication date: 23 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (10)
Uniform constant-depth threshold circuits for division and iterated multiplication. ⋮ A complexity theory for feasible closure properties ⋮ Query-monotonic Turing reductions ⋮ Relating the bounded arithmetic and polynomial time hierarchies ⋮ Average-case intractability vs. worst-case intractability ⋮ Bounded queries to SAT and the Boolean hierarchy ⋮ Frequency computation and bounded queries ⋮ Reductions to sets of low information content ⋮ Boolean operations, joins, and the extended low hierarchy ⋮ A note on enumerative counting
This page was built for publication:
