Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time (Q3373669): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MAX-2-SAT / rank | |||
Normal rank | |||
Revision as of 20:46, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time |
scientific article |
Statements
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time (English)
0 references
13 March 2006
0 references
random graph
0 references
algorithm
0 references
independent set
0 references
vertex cover
0 references
binomial distributions
0 references
random walks
0 references
