scientific article
From MaRDI portal
Publication:3217604
zbMath0554.68032MaRDI QIDQ3217604
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
polynomial-time hierarchycounting problemscomplexity of combinatorial problemssuccinct input presentation
Analysis of algorithms and problem complexity (68Q25) Hierarchies of computability and definability (03D55)
Related Items
The complexity of combinatorial problems with succinct input representation ⋮ Some observations on the connection between counting and recursion ⋮ On counting propositional logic and Wagner's hierarchy
