A note on the approximability of deepest-descent circuit steps (Q2060534)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on the approximability of deepest-descent circuit steps |
scientific article; zbMATH DE number 7443019
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the approximability of deepest-descent circuit steps |
scientific article; zbMATH DE number 7443019 |
Statements
A note on the approximability of deepest-descent circuit steps (English)
0 references
13 December 2021
0 references
circuits
0 references
linear programming
0 references
deepest-descent steps
0 references
complexity theory
0 references
0 references
