Bridging between 0/1 and linear programming via random walks (Q5212799): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q293456 |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Venkatesan Guruswami / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2963129052 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1904.04860 / rank | |||
Normal rank | |||
Latest revision as of 00:53, 20 April 2024
scientific article; zbMATH DE number 7160535
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bridging between 0/1 and linear programming via random walks |
scientific article; zbMATH DE number 7160535 |
Statements
Bridging between 0/1 and linear programming via random walks (English)
0 references
30 January 2020
0 references
constraint satisfaction problems
0 references
integer programming
0 references
linear programming
0 references
random walks
0 references
strong exponential time hypothesis
0 references
