Phase Transitions of PP-Complete Satisfiability Problems


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 PPcomplete Boolean… (More)
DOI: 10.1016/j.dam.2006.09.014


2 Figures and Tables

Slides referencing similar topics