Hard Enumeration Problems in Geometry and Combinatorics
- 1 April 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 7 (2), 331-335
- https://doi.org/10.1137/0607036
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- The Information-Theoretic Bound is Good for MergingSIAM Journal on Computing, 1984
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is ConnectedSIAM Journal on Computing, 1983
- Two combinatorial applications of the Aleksandrov-Fenchel inequalitiesJournal of Combinatorial Theory, Series A, 1981
- The Complexity of Enumeration and Reliability ProblemsSIAM Journal on Computing, 1979
- The complexity of computing the permanentTheoretical Computer Science, 1979
- Acyclic orientations of graphsDiscrete Mathematics, 1973
- An Algorithm for Distinct RepresentativesThe American Mathematical Monthly, 1956