36 search results - page 3 / 8 » New upper bound formulas with parameters for Ramsey numbers |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We give a new insight into the upper bounding of the 3-SAT threshold by the first moment method. The best criteria developed so far to select the solutions to be counted discrimina...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The oriented chromatic number of an oriented graph G is the minimum order of an oriented graph H such that G admits a homomorphism to H. The oriented chromatic number of an undire...
COMBINATORICS
2004
13 years 6 months ago
2004
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive...
ACTA
2007
13 years 7 months ago
2007
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...
JC
2007
13 years 7 months ago
2007
We construct simple algorithms for high-dimensional numerical integration of function classes with moderate smoothness. These classes consist of square-integrable functions over t...