4 citations · 5 across the 3 of their papers we have counts for
1 paper · 2 filters
Cristopher Moore, Gabriel Istrate, Demetrios Demopoulos +1
We compute the probability of satisfiability of a class of random Horn-SAT formulae, motivated by a connection with the nonemptiness problem of finite tree automata. In particular,…