Hard Enumeration Problems in Geometry and Combinatorics
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- Acyclic orientations of graphs
- An Algorithm for Distinct Representatives
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- The Complexity of Enumeration and Reliability Problems
- The Information-Theoretic Bound is Good for Merging
- The complexity of computing the permanent
- Two combinatorial applications of the Aleksandrov-Fenchel inequalities
Cited in
(52)- A weighted graph polynomial from chromatic invariants of knots
- Complexity of the Bollobás-Riordan Polynomial
- A note on a counting problem arising in percolation theory
- scientific article; zbMATH DE number 7559233 (Why is no real title available?)
- Searching for acyclic orientations of graphs
- A Dichotomy Theorem for Polynomial Evaluation
- \#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method
- Laplacian ideals, arrangements, and resolutions
- On unique graph 3-colorability and parsimonious reductions in the plane
- The maximum clique problem
- Short certificates for chromatic equivalence
- Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions
- The Computational Complexity of the Tutte Plane: the Bipartite Case
- Towards a dichotomy theorem for the counting constraint satisfaction problem
- Inapproximability of the Tutte polynomial
- Harary polynomials
- The harmonic polytope
- Counting linear extensions
- Complexity and approximability of the cover polynomial
- scientific article; zbMATH DE number 939815 (Why is no real title available?)
- On the number of upward planar orientations of maximal planar graphs
- Elements of a theory of simulation. II: Sequential dynamical systems.
- Largest \(j\)-simplices in \(n\)-polytopes
- Efficient enumeration of graph orientations with sources
- Direct sampling of confined polygons in linear time
- Dominic Welsh: his work and influence
- The distribution of the length of the longest path in random acyclic orientations of a complete bipartite graph
- Complexity of counting feedback vertex sets
- Eigenpolytope Universality and Graphical Designs
- Complexity of approximating the vertex centroid of a polyhedron
- Encoding and enumerating acyclic orientations of graphs
- Meta-theorems for graph polynomials
- Counting polygon triangulations is hard
- Equality cases of the Alexandrov-Fenchel inequality are not in the polynomial hierarchy
- Combinatorial Generation via Permutation Languages. V. Acyclic Orientations
- Monomial bases for broken circuit complexes
- Acyclic polynomials of graphs
- Complexity and algorithms for computing Voronoi cells of lattices
- From a zoo to a zoology: Towards a general theory of graph polynomials
- Signable posets and partitionable simplicial complexes
- Subtractive reductions and complete problems for counting complexity classes
- On enumerating all minimal solutions of feedback problems
- Counting and sampling orientations on chordal graphs
- Dichotomy results for fixed point counting in Boolean dynamical systems
- Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- On the complexity of some basic problems in computational convexity. I. Containment problems
- Connection Matrices for MSOL-Definable Structural Invariants
- On the computational complexity of the Jones and Tutte polynomials
- Enumerative techniques for solving some nonconvex global optimization problems
- Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph
- On the complexity of generalized chromatic polynomials
This page was built for publication: Hard Enumeration Problems in Geometry and Combinatorics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3730017)
