scientific article; zbMATH DE number 3874610

MaRDI QIDQ3340149zbMATH OpenFDO

Authors K. W. Wagner

Publication date 1984

zbMATH Keywords

compact descriptioncomplete setscomplexitycounting polynomial-time hierarchydescriptional languagesfinite sets of natural numbersfinite sets of rectanglesproperties of finite sets

Mathematics Subject Classification ID

Hierarchies of computability and definability (03D55) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Discrete mathematics in relation to computer science (68R99)

Recommendations

• scientific article; zbMATH DE number 3883612
• The complexity of combinatorial problems with succinct input representation
• scientific article; zbMATH DE number 3874609
• scientific article; zbMATH DE number 1113995
• Instance complexity

Cited in

(5)

• The complexity of combinatorial problems with succinct input representation
• scientific article; zbMATH DE number 3883612 (Why is no real title available?)
• scientific article; zbMATH DE number 3874609 (Why is no real title available?)
• scientific article; zbMATH DE number 4213461 (Why is no real title available?)
• The Complexity of Problems in P Given Correlated Instances

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 Q3340149)