Is constraint satisfaction over two variables always easy? (Q3156915): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4251055 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new multilayered PCP and the hardness of hypergraph vertex cover / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the power of unique 2-prover 1-round games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4146884 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Outward rotations / rank | |||
Normal rank |
Latest revision as of 17:16, 7 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Is constraint satisfaction over two variables always easy? |
scientific article |
Statements
Is constraint satisfaction over two variables always easy? (English)
0 references
12 January 2005
0 references
Not-All-Equal Sat
0 references
0 references