scientific article; zbMATH DE number 3883612

zbMATH Open0554.68032MaRDI QIDQ3217604FDOQ3217604

Authors: K. W. Wagner 

Publication date: 1984

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

counting problemspolynomial-time hierarchycomplexity of combinatorial problemssuccinct input presentation

Mathematics Subject Classification ID

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

Cited In (10)

• Compactors for parameterized counting problems
• Towards logical foundations for probabilistic computation
• Some observations on the connection between counting and recursion
• Instance compression for the polynomial hierarchy and beyond
• The complexity of combinatorial problems with succinct input representation
• On counting propositional logic and Wagner's hierarchy
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)