๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A new upper bound for (n, 3)-MAX-SAT

โœ Scribed by I. A. Bliznets

Book ID
118804180
Publisher
Springer US
Year
2012
Tongue
English
Weight
235 KB
Volume
188
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

New Worst-Case Upper Bounds for SAT
New Worst-Case Upper Bounds for SAT
โœ Edward A. Hirsch ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 153 KB
A General Upper Bound for the Satisfiabi
A General Upper Bound for the Satisfiability Threshold of Randomr-SAT Formulae
โœ O Dubois; Y Boufkhad ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 280 KB

Experiments on solving r-SAT random formulae have provided evidence of a satisfiability threshold phenomenon with respect to the ratio of the number of clauses to the number of variables of formulae. Presently, only the threshold of 2-SAT formulae has been proved to exist and has been computed to be

A new entropy upper bound
A new entropy upper bound
โœ N. ลขฤƒpuลŸ; P.G. Popescu ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 196 KB
A new upper bound for Shellsort
A new upper bound for Shellsort
โœ Robert Sedgewick ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 796 KB
An improved upper bound for Ramsey numbe
An improved upper bound for Ramsey number N (3, 3, 3, 3; 2)
โœ Adolfo Sanchez-Flores ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 251 KB

The Ramsey number N(3, 3, 3, 3; 2) is the smallest integer n such that each 4-coloring by edges of the complete graph on n vertices contains monochromatic triangles. It is well known that 51 ~< N(3,3,3,3;2) ~< 65. Here we prove that N(3,3,3,3;2) ~< 64.