Pages that link to "Item:Q1741477"
From MaRDI portal
The following pages link to On a family of \(0/1\)-polytopes with an NP-complete criterion for vertex nonadjacency relation (Q1741477):
Displaying 3 items.
- The common face of some 0/1-polytopes with NP-complete nonadjacency relation (Q2259297) (← links)
- On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube (Q2419579) (← links)
- One-parameter family of Neville-Aitken algorithm on \(q\)-triangle (Q5952800) (← links)