J.-C. Simon, J. Carlier, O. Dubois, and O. Moulines, " ' Etude statistique de l' existence de solutions de probl`emes SAT, application aux syst`emes-experts," C.R. Acad. Sci. Paris. S'er. I Math. 302, pp 283--286, 1986. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Approximating the Unsatisfiability Threshold of Random.. - Kirousis, Kranakis.. (1995) (33 citations) (Correct)
.... that the expected value of the number of truth assignments that satisfy OE is 2 , then let this expected value converge to zero and use Markov s inequality (this argument is expanded below) According to Chv atal and Reed [4] this observation is due to Franco and Paull [6] Simon et al. [14], Chv atal and Szemer edi [5] and possibly others. Let An be the set of all truth assignments on the n variables x 1 ; xn , and let Sn be the set of truth assignments that satisfy the random formula OE. The cardinality jS n j is thus a random variable. Also, for an instantiation OE of the ....
J.-C. Simon, J. Carlier, O. Dubois, and O. Moulines, " ' Etude statistique de l' existence de solutions de probl`emes SAT, application aux syst`emes-experts," C.R. Acad. Sci. Paris. S'er. I Math. 302, pp 283--286, 1986.
Approximating the Unsatisfiability Threshold of Random.. - Lefteris Kirousis Kirousis (1995) (33 citations) (Correct)
.... expected value of the number of truth assignments that satisfy OE is 2 n (7=8) rn , then let this expected value converge to zero and use Markov s inequality (this argument is expanded below) According to Chv atal and Reed [3] this observation is due to Franco and Paull [5] Simon et al. [13], Chv atal and Szemer edi [4] and possibly others. Let A n be the set of all truth assignments on the n variables x 1 ; x n , and let S n be the set of truth assignments that satisfy the random formula OE. The cardinality jS n j is thus a random variable. Also, for an instantiation OE of ....
J.-C. Simon, J. Carlier, O. Dubois, and O. Moulines, " ' Etude statistique de l' existence de solutions de probl`emes SAT, application aux syst`emes-experts," C.R. Acad. Sci. Paris. S'er. I Math. 302, pp 283--286, 1986.
Approximating the Unsatisfiability Threshold of.. - Kirousis, Kranakis.. (1995) (33 citations) (Correct)
.... expected value of the number of truth assignments that satisfy OE is 2 n (7=8) rn , then let this expected value converge to zero and use Markov s inequality (this argument is expanded below) According to Chv atal and Reed [5] this observation is due to Franco and Paull [8] Simon et al. [19], Chv atal and Szemer edi [6] and possibly others. Let A n be the set of all truth assignments on the n variables x 1 ; x n , and let S n be the set of truth assignments that satisfy the random formula OE. Thus the cardinality jS n j is a random variable. Also, for an instantiation OE of ....
J.-C. Simon, J. Carlier, O. Dubois, and O. Moulines, " ' Etude statistique de l' existence de solutions de probl`emes SAT, application aux syst`emes-experts," C.R. Acad. Sci. Paris. S'er. I Math. 302, pp 283--286, 1986.
On Extending Two Threshold 3-SAT Algorithms to.. - Chris Giannella.. (Correct)
....region. 1.1 Bounds on the conjectured value of c Non constructive approaches have been used to prove upper bounds on the conjectured value of c . A first upper bound of 8ln2 was proven by Franco and Paul [7] and independently by Chvatal and Reed [5] and Simon, Carlier, Dubois, and Moulines [21] using the first moment method. Improvements on the upper bound have been made by Maftouhi and Vega (5.08) 18] by Kamath, Motwani, Palem, and Spirakis (4.758) 15] and most recently by Kirousis, Kranakis, Krizanc (4.598) 14] The last result represents the current best upper bound. ....
J-C. Simon, J. Carlier, O. Dubois, O. Moulines, Etude statistique de l' existence de solutions de problemes SAT, application aux systemesexperts, C.R. Acad Sci. Paris. Ser I Math. 302, pg. 283-286, 1986 13
Approximating the Unsatisfiability Threshold of.. - Kirousis, Kranakis.. (1996) (33 citations) (Correct)
.... expected value of the number of truth assignments that satisfy OE is 2 n (7=8) rn , then let this expected value converge to zero and use Markov s inequality (this argument is expanded below) According to Chv atal and Reed [5] this observation is due to Franco and Paull [8] Simon et al. [19], Chv atal and Szemer edi [6] and possibly others. Let A n be the set of all truth assignments on the n variables x 1 ; x n , and let S n be the set of truth assignments that satisfy the random formula OE. The cardinality jS n j is thus a random variable. Also, for an instantiation OE of ....
J.-C. Simon, J. Carlier, O. Dubois, and O. Moulines, " ' Etude statistique de l' existence de solutions de probl`emes SAT, application aux syst`emes-experts," C.R. Acad. Sci. Paris. S'er. I Math. 302, pp 283--286, 1986.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC