scientific article; zbMATH DE number 1335885

MaRDI QIDQ4258576zbMATH OpenFDO

Authors R. E. Stearns, Madhav V. Marathe, H. B. III Hunt, Daniel J. Rosenkrantz

Publication date 13 September 1999

zbMATH Keywords

complexity classessatisfiability problems

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Computational complexity of periodicity problems in max-plus algebra
• Periodic constraint satisfaction problems: polynomial-time algorithms
• scientific article; zbMATH DE number 1113995
• Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems
• Periodic constraint satisfaction problems: Tractable subclasses
• Linear complexity of periodic sequences: a general theory
• Polynomial time approximation schemes and parameterized complexity
• Mathematical Foundations of Computer Science 2004
• scientific article; zbMATH DE number 3902037
• Complexity of approximation problems

Cited in

(4)

• Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version)
• scientific article; zbMATH DE number 1113995 (Why is no real title available?)
• scientific article; zbMATH DE number 1560343 (Why is no real title available?)
• Periodic constraint satisfaction problems: Tractable subclasses

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