no. 3
A probabilistic analysis of a new satisfiability algorithm
RAIRO. Informatique théorique, Tome 16 (1982) no. 3, pp. 201-223 
@article{ITA_1982__16_3_201_0,
     author = {Apolloni, B. and Di Gregorio, S.},
     title = {A probabilistic analysis of a new satisfiability algorithm},
     journal = {RAIRO. Informatique th\'eorique},
     pages = {201--223},
     year = {1982},
     publisher = {EDP Sciences},
     volume = {16},
     number = {3},
     mrnumber = {686913},
     zbl = {0489.68038},
     language = {en},
     url = {https://www.numdam.org/item/ITA_1982__16_3_201_0/}
}
TY  - JOUR
AU  - Apolloni, B.
AU  - Di Gregorio, S.
TI  - A probabilistic analysis of a new satisfiability algorithm
JO  - RAIRO. Informatique théorique
PY  - 1982
SP  - 201
EP  - 223
VL  - 16
IS  - 3
PB  - EDP Sciences
UR  - https://www.numdam.org/item/ITA_1982__16_3_201_0/
LA  - en
ID  - ITA_1982__16_3_201_0
ER  - 
%0 Journal Article
%A Apolloni, B.
%A Di Gregorio, S.
%T A probabilistic analysis of a new satisfiability algorithm
%J RAIRO. Informatique théorique
%D 1982
%P 201-223
%V 16
%N 3
%I EDP Sciences
%U https://www.numdam.org/item/ITA_1982__16_3_201_0/
%G en
%F ITA_1982__16_3_201_0
Apolloni, B.; Di Gregorio, S. A probabilistic analysis of a new satisfiability algorithm. RAIRO. Informatique théorique, Tome 16 (1982) no. 3, pp. 201-223. https://www.numdam.org/item/ITA_1982__16_3_201_0/

1. K. J. Astrom, Introduction to Stochastic Control Theory, NewYork, London, Academic Press, 1970. | Zbl | MR

2. D. E. Barton and F. N. David, Combinatorial Chance, London, Griffin, 1972.

3. A. T. Bharuka-Reid, Elements of the Theory of Markov Processes and their Applications, London, McGraw-Hill, 1960. | Zbl | MR

4. S. A. Cook, The Complexity of Theorem-Proving Procedures, Proc. third A.C.M. Symposium on Theory of Computing, 1971, pp. 151-158. | Zbl

5. H. Kramer, Mathematical Methods of Statistics, Princeton, Princeton University Press, 1945. | Zbl

6. Z. Galil, On Enumeration Procedures for Theorem Proving and for Integer Programming, Automata Languages and Programming Third International Colloquim, S. MICHAELSON and R. MILNER, Eds., Edinburg University Press, 1976, pp. 355-381. | Zbl

7. M. R. Garey and D. S. Johnson, Computers and Intractability, San Francisco, W. H. Freeman and C., 1979. | Zbl | MR

8. R. M. Karp, Reducibility among Combinatorial Problems, in Complexity of Conputer Computations, R. E. MILLER and J. W. THATCHER, Eds., New York, Plenum Press, 1972, pp. 85-104. | Zbl | MR

9. R. M. Karp, On the Computational Complexity of Combinatorial Problems, Networks, Vol. 5, 1974, pp. 45-68. | Zbl

10. R. M. Karp, The Probabilistic Analysis of some Combinatorial Search Algorithm, Memorandum No. ERL-M581, University of California, Berkeley, 1976. | MR

11. V. F. Kolchin, B. A. Sevastiyanov and V. P. Chistianov, Random Allocations, NewYork, John Wiley, 1978. | Zbl

12. H. L. Lewis, Satisfiability Problems for Propositional Calculi, Math. System Theory, Vol. 13, 1979, pp. 45-53. | Zbl | MR

13. R. Otter, The Multiplicative Process, Ann. Math. Statist., Vol. 20, 1949, pp. 206-224. | Zbl | MR

14. T. J. Shaeffer, The Complexity of Statisfiability Problems, X Sym. on Theory of Computing, 1978, pp. 216-226.

15. D. L. Snyder Random Point Processes, New York, John Wiley, 1975. | Zbl | MR