scientific article; zbMATH DE number 3883612

MaRDI QIDQ3217604zbMATH OpenFDO

Authors K. W. Wagner

Publication date 1984

zbMATH Keywords

complexity of combinatorial problemscounting problemspolynomial-time hierarchysuccinct input presentation

Mathematics Subject Classification ID

Hierarchies of computability and definability (03D55) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The complexity of combinatorial problems with succinct input representation
• scientific article; zbMATH DE number 3874610
• scientific article; zbMATH DE number 4115979
• Succinct representations of graphs
• scientific article; zbMATH DE number 4213461

Cited in

(11)

• The complexity of combinatorial problems with succinct input representation
• Some observations on the connection between counting and recursion
• scientific article; zbMATH DE number 3874609 (Why is no real title available?)
• scientific article; zbMATH DE number 3874610 (Why is no real title available?)
• scientific article; zbMATH DE number 4213461 (Why is no real title available?)
• scientific article; zbMATH DE number 3968574 (Why is no real title available?)
• scientific article; zbMATH DE number 4115979 (Why is no real title available?)
• Instance compression for the polynomial hierarchy and beyond
• On counting propositional logic and Wagner's hierarchy
• Towards logical foundations for probabilistic computation
• Compactors for parameterized counting problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3217604)