Optimal 2-constraint satisfaction via sum-product algorithms (Q844150): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Faster exact algorithms for hard problems: A parameterized point of view / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bucket elimination: A unifying framework for reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factor graphs and the sum-product algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified NP-complete MAXSAT problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast multiplication of large numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algebraic Model for Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for optimal 2-constraint satisfaction and its implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414647 / rank
 
Normal rank

Latest revision as of 09:00, 2 July 2024

scientific article
Language Label Description Also known as
English
Optimal 2-constraint satisfaction via sum-product algorithms
scientific article

    Statements

    Identifiers