Sciweavers

STOC
2009
ACM
106views Algorithms» more  STOC 2009»
15 years 4 days ago
Random graphs and the parity quantifier
The classical zero-one law for first-order logic on random graphs says that for every first-order property in the theory of graphs and every p (0, 1), the probability that the r...
Phokion G. Kolaitis, Swastik Kopparty