A note on the approximability of deepest-descent circuit steps (Q2060534)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A note on the approximability of deepest-descent circuit steps
scientific article

    Statements

    A note on the approximability of deepest-descent circuit steps (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 December 2021
    0 references
    0 references
    circuits
    0 references
    linear programming
    0 references
    deepest-descent steps
    0 references
    complexity theory
    0 references
    0 references