scientific article; zbMATH DE number 3999297
From MaRDI portal
Publication:4725752
zbMath0616.68050MaRDI QIDQ4725752
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
NP-complete setsbounded quantificationlogarithmic alternation hierarchynondeterministic many-one log-space reductions
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (4)
The logarithmic alternation hierarchy collapses: \(A\Sigma _ 2^{{\mathcal L}}=A\Pi_ 2^{{\mathcal L}}\) ⋮ Inductive counting below logspace ⋮ Empty alternation ⋮ Complexity classes of equivalence problems revisited
This page was built for publication:
