Parsimonious #P-hardness of counting exact covers by triples
ProvedCountOrderings.NFree.x3c_parsimonious_hardcounting-complexitylinear-extensions
The function counting exact covers of an indexed family of triples is #P-hard under parsimonious polynomial-time reductions on the published Cook–Levin machine model. Instances are encoded by unary dimension headers and an incidence matrix, and the count on malformed words is zero. An exact cover is a set of indices whose triples partition the universe.
Preamble
import Definitions.Def_CountOrderings_NFree_OracleReduction import Definitions.Def_NQueensComp_NPC_SharpP
Formal statement
namespace CountOrderings.NFree theorem x3c_parsimonious_hard : NQueensComp.NPC.SharpPHard x3cCount := by sorry end CountOrderings.NFree
Source
Hunt, Marathe, Radhakrishnan and Stearns, The Complexity of Planar Counting Problems, https://doi.org/10.1137/S0097539793304601, Theorem 3.10 and Corollary 3.11, pp. 1155–1156, specialized to the unrestricted problem and the stated encoding. Cited as HMRS98 in Arenas, Schild and Subercaseaux, Hardness of Counting Orderings: Taking Gadget Amplification to the Limit, STOC 2027 submission #1207, https://github.com/sigact-stoc/stoc2027/releases/download/papers-2/1207.pdf, §3.