On the Lower Bounds of Random Max 3 and 4-SAT (Q4632196): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the maximum satisfiability of random formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1.0957-Approximation Algorithm for Random MAX-3SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the 4-satisfiability threshold / rank
 
Normal rank

Latest revision as of 01:26, 19 July 2024

scientific article; zbMATH DE number 7048093
Language Label Description Also known as
English
On the Lower Bounds of Random Max 3 and 4-SAT
scientific article; zbMATH DE number 7048093

    Statements

    Identifiers