NP-completeness of Partial Chirotope Extendibility
Patrick Baier
Abstract
In the monograph "Axioms and Hulls" (1992) Donald Knuth studies some axiomatizations of geometric situations. The structures described by one of the axiom systems are called CC-systems. Knuth proves that it is NP-complete to decide, whether a partially defined CC-system can be extended to a complete CC-system. The aim of this note is to show that Knuth's proof of this result also implies that it is NP-complete to decide the extendability of partially defined chirotopes.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.