Title of article
Phase transitions of PP-complete satisfiability problems Original Research Article
Author/Authors
Delbert D. Bailey، نويسنده , , V?ctor Dalmau، نويسنده , , Phokion G. Kolaitis، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
13
From page
1627
To page
1639
Abstract
The complexity class PP consists of all decision problems solvable by polynomial-time probabilistic Turing machines. It is well known that PP is a highly intractable complexity class and that PP-complete problems are in all likelihood harder than NP-complete problems. We investigate the existence of phase transitions for a family of PP-complete Boolean satisfi
Keywords
PP-complete , Phase transitions , Satisfiability
Journal title
Discrete Applied Mathematics
Serial Year
2007
Journal title
Discrete Applied Mathematics
Record number
886532
Link To Document