Phase transitions of EXPSPACE-complete problems: a further step
From MaRDI portal
Recommendations
Cites work
- Critical Behavior in the Satisfiability of Random Boolean Expressions
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- Many hard examples in exact phase transitions
- Phase transitions of EXPSPACE-complete problems
- Phase transitions of PP-complete satisfiability problems
- Random constraint satisfaction: easy generation of hard (satisfiable) instances
- Random MAX SAT, random MAX CUT, and their phase transitions
- The TSP phase transition
Cited in
(8)- Phase transitions of PP-complete satisfiability problems
- Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems
- Phase transitions of EXPSPACE-complete problems
- Structural attack to anonymous graph of social networks
- Phase Transition for Maximum Not-All-Equal Satisfiability
- Phase transitions of contingent planning problem
- Typical case complexity and phase transitions. Papers from the workshop, Ottawa, ON, Canada, May 14--16, 2003
- An upper (lower) bound for Max (Min) CSP
This page was built for publication: Phase transitions of EXPSPACE-complete problems: a further step
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2909190)