Pages that link to "Item:Q1761001"

The following pages link to On affine reducibility of combinatorial polytopes (Q1761001):

Displaying 5 items.

• On a family of \(0/1\)-polytopes with an NP-complete criterion for vertex nonadjacency relation (Q1741477) (← links)
• \(k\)-neighborly faces of the Boolean quadric polytopes (Q2259296) (← links)
• The common face of some 0/1-polytopes with NP-complete nonadjacency relation (Q2259297) (← links)
• Combinatorial structure and adjacency of vertices of polytope of \(b\)-factors (Q2262901) (← links)
• The simplest families of polytopes associated with NP-hard problems (Q2353062) (← links)