The phase transition in random Horn satisfiability and its algorithmic implications

Authors:
Gabriel Istrate
Affiliations:
Department of Computer Science, University of Rochester, Rochester, NY
Venue:
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Year:
1999

Citing 3
Cited 1

Threshold functions

Combinatorica
A threshold for unsatisfiability

Journal of Computer and System Sciences
The complexity of satisfiability problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing

The phase transition in random horn satisfiability and its algorithmic implications

Random Structures & Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract