Indexed metadata
Hard Enumeration Problems in Geometry and Combinatorics
Nathan Linial
Source abstract
A number of natural enumeration problems in geometry and combinatorics are shown to be complete in the class # P introduced by Valiant. Among others this is established for the numeration of vertices and of facets of a polytope, acyclic orientations of a graph and satisfying assignments of implicative boolean formulas.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.