Author： Istrate Gabriel
Publisher： Taylor & Francis Ltd
ISSN： 0020-7160
Source： International Journal of Computer Mathematics, Vol.86, Iss.12, 2009-12, pp. : 2029-2039
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Random k‐SAT and the power of two choices
RANDOM STRUCTURES AND ALGORITHMS, Vol. 47, Iss. 1, 2015-08 ,pp. :
Access to resources
Recommend
Absorbing random walks and the NAE2SAT problem
By Subramani K.
International Journal of Computer Mathematics, Vol. 88, Iss. 3, 2011-02 ,pp. :
Firefighting on a random geometric graph
RANDOM STRUCTURES AND ALGORITHMS, Vol. 46, Iss. 3, 2015-05 ,pp. :
A General Upper Bound for the Satisfiability Threshold of Random r-SAT Formulae
Journal of Algorithms, Vol. 24, Iss. 2, 1997-08 ,pp. :
On pseudo-random properties of P (n) and P (n + 1)
By Rivat J.
Periodica Mathematica Hungarica, Vol. 43, Iss. 1-2, 2002-08 ,pp. :