scientific article
From MaRDI portal
Publication:3929039
zbMath0474.68047MaRDI QIDQ3929039
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Primes (11A41) Algorithms in computer science (68W99)
Related Items (5)
\(\text{S}_{2}^{\text{P}} \subseteq \text{ZPP}^{\text{NP}}\) ⋮ Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas ⋮ If NP has polynomial-size circuits, then MA=AM ⋮ Competing provers yield improved Karp-Lipton collapse results ⋮ A low and a high hierarchy within NP
This page was built for publication:
