Pages that link to "Item:Q2259297"
From MaRDI portal
The following pages link to The common face of some 0/1-polytopes with NP-complete nonadjacency relation (Q2259297):
Displaying 6 items.
- On a family of \(0/1\)-polytopes with an NP-complete criterion for vertex nonadjacency relation (Q1741477) (← links)
- The simplest families of polytopes associated with NP-hard problems (Q2353062) (← links)
- Boolean quadric polytopes are faces of linear ordering polytopes (Q2403680) (← links)
- Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes (Q2959185) (← links)
- The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract) (Q2971660) (← links)
- Affine maps between quadratic assignment polytopes and subgraph isomorphism polytopes (Q5865703) (← links)
