@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}, publisher = {EDP-Sciences}, volume = {16}, number = {3}, year = {1982}, mrnumber = {686913}, zbl = {0489.68038}, language = {en}, url = {http://archive.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 - http://archive.numdam.org/item/ITA_1982__16_3_201_0/ LA - en ID - ITA_1982__16_3_201_0 ER -
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. http://archive.numdam.org/item/ITA_1982__16_3_201_0/
1. Introduction to Stochastic Control Theory, NewYork, London, Academic Press, 1970. | MR | Zbl
,2. Combinatorial Chance, London, Griffin, 1972.
and ,3. Elements of the Theory of Markov Processes and their Applications, London, McGraw-Hill, 1960. | MR | Zbl
,4. The Complexity of Theorem-Proving Procedures, Proc. third A.C.M. Symposium on Theory of Computing, 1971, pp. 151-158. | Zbl
,5. Mathematical Methods of Statistics, Princeton, Princeton University Press, 1945. | Zbl
,6. 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. Computers and Intractability, San Francisco, W. H. Freeman and C., 1979. | MR | Zbl
and ,8. 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. | MR | Zbl
,9. On the Computational Complexity of Combinatorial Problems, Networks, Vol. 5, 1974, pp. 45-68. | Zbl
,10. The Probabilistic Analysis of some Combinatorial Search Algorithm, Memorandum No. ERL-M581, University of California, Berkeley, 1976. | MR
,11. Random Allocations, NewYork, John Wiley, 1978. | Zbl
, and ,12. Satisfiability Problems for Propositional Calculi, Math. System Theory, Vol. 13, 1979, pp. 45-53. | MR | Zbl
,13. The Multiplicative Process, Ann. Math. Statist., Vol. 20, 1949, pp. 206-224. | MR | Zbl
,14. The Complexity of Statisfiability Problems, X Sym. on Theory of Computing, 1978, pp. 216-226.
,15. Random Point Processes, New York, John Wiley, 1975. | MR | Zbl