On the complexity of four polyhedral set containment problems (Q3703587): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Optimal scaling of balls and polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3254327 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01582241 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2116403087 / rank
 
Normal rank

Latest revision as of 09:48, 30 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of four polyhedral set containment problems
scientific article

    Statements

    On the complexity of four polyhedral set containment problems (English)
    0 references
    0 references
    0 references
    0 references
    1985
    0 references
    0 references
    0 references
    0 references
    0 references
    H-cell
    0 references
    W-cell
    0 references
    computational complexity
    0 references
    set containment problems
    0 references
    NP- complete
    0 references
    0 references
    0 references