Probabilistic bounds and algorithms for the maximum satisfiability problem (Q920845): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Prékopa, András / rank
Normal rank
 
Property / author
 
Property / author: Prékopa, András / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results and experiments in programming techniques for propositional logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A thermodynamically motivated simulation procedure for combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many hard examples for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Timetable and Multicommodity Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3827800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average time analyses of simplified Davis-Putnam procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roof duality, complementation and persistency in quadratic 0–1 optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the maximum satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution vs. cutting plane solution of inference problems: Some computational experience / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the maximum satisfiability problem for Horn formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5535148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Partial Satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic extremal problems in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roof duality for polynomial 0–1 optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boole-Bonferroni Inequalities and Linear Programming / rank
 
Normal rank

Latest revision as of 11:19, 21 June 2024

scientific article
Language Label Description Also known as
English
Probabilistic bounds and algorithms for the maximum satisfiability problem
scientific article

    Statements

    Probabilistic bounds and algorithms for the maximum satisfiability problem (English)
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    0 references
    0 references
    0 references
    0 references
    maximum satisfiability problem
    0 references
    probabilistic bounds
    0 references
    heuristic
    0 references