scientific article
From MaRDI portal
Publication:3219763
zbMath0556.68014MaRDI QIDQ3219763
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (6)
Nonlevelable sets and immune sets in the accepting density hierarchy inNP ⋮ On solving hard problems by polynomial-size circuits ⋮ The structure of generalized complexity cores ⋮ On optimal polynomial time approximations: P-levelability vs. δ-levelability ⋮ On inefficient special cases of NP-complete problems ⋮ On hard instances
This page was built for publication: