Phase transitions of PP-complete satisfiability problems

Authors:
Delbert D. Bailey;Víctor Dalmau;Phokion G. Kolaitis
Affiliations:
Computer Science Department, University of California, Santa Cruz, CA;Computer Science Department, University of California, Santa Cruz, CA;Computer Science Department, University of California, Santa Cruz, CA
Venue:
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Year:
2001

Citing 19
Cited 6

Probabilistic analysis of two heuristics for the 3-satisfiability problem

SIAM Journal on Computing
Dempster's rule of combination is #P-complete (research note)

Artificial Intelligence
The computational complexity of propositional STRIPS planning

Artificial Intelligence
On the hardness of approximate reasoning

Artificial Intelligence
Generating hard satisfiability problems

Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
A threshold for unsatisfiability

Journal of Computer and System Sciences
Beyond NP: the QSAT phase transition

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Initial experiments in stochastic satisfiability

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract)

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Bounding the unsatisfiability threshold of random 3-SAT

Random Structures & Algorithms
Stochastic Boolean Satisfiability

Journal of Automated Reasoning
Counting Models Using Connected Components

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Experimental Analysis of the Computational Cost of Evaluating Quantified Boolean Formulae

AI*IA '97 Proceedings of the 5th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
Optimal myopic algorithms for random 3-SAT

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
On some central problems in computational complexity.

On some central problems in computational complexity.
On the computational power of PP and (+)P

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Mick gets some (the odds are on his side) (satisfiability)

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
The computational complexity of probabilistic planning

Journal of Artificial Intelligence Research
The good old Davis-Putnam procedure helps counting models

Journal of Artificial Intelligence Research

Comparing phase transitions and peak cost in PP-complete satisfiability problems

Eighteenth national conference on Artificial intelligence
Computational complexity of queries based on itemsets

Information Processing Letters
The inferential complexity of Bayesian and credal networks

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Computational complexity of queries based on itemsets

Information Processing Letters
Is computational complexity a barrier to manipulation?

CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
Where are the hard manipulation problems?

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of how an agent creates a discrete spatial representation from its continuous interactions with the environment. Such representation will be the minimal one that explains the experiences of the agent in the environment. In this ...