Pages that link to "Item:Q3730017"
From MaRDI portal
The following pages link to Hard Enumeration Problems in Geometry and Combinatorics (Q3730017):
Displaying 48 items.
- Complexity and approximability of the cover polynomial (Q445242) (← links)
- Laplacian ideals, arrangements, and resolutions (Q472634) (← links)
- On unique graph 3-colorability and parsimonious reductions in the plane (Q596079) (← links)
- On the complexity of generalized chromatic polynomials (Q679542) (← links)
- A note on a counting problem arising in percolation theory (Q685697) (← links)
- Complexity of approximating the vertex centroid of a polyhedron (Q764376) (← links)
- Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594) (← links)
- Inapproximability of the Tutte polynomial (Q937302) (← links)
- Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions (Q987376) (← links)
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- Monomial bases for broken circuit complexes (Q1041597) (← links)
- Enumerative techniques for solving some nonconvex global optimization problems (Q1102205) (← links)
- Counting linear extensions (Q1183942) (← links)
- A weighted graph polynomial from chromatic invariants of knots (Q1296158) (← links)
- The maximum clique problem (Q1318271) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- On enumerating all minimal solutions of feedback problems (Q1348395) (← links)
- Elements of a theory of simulation. II: Sequential dynamical systems. (Q1569128) (← links)
- Block interpolation: a framework for tight exponential-time counting complexity (Q1640999) (← links)
- Efficient enumeration of graph orientations with sources (Q1647832) (← links)
- Largest \(j\)-simplices in \(n\)-polytopes (Q1892425) (← links)
- Searching for acyclic orientations of graphs (Q1898338) (← links)
- Signable posets and partitionable simplicial complexes (Q1913695) (← links)
- \#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method (Q2106620) (← links)
- Counting and sampling orientations on chordal graphs (Q2154115) (← links)
- Counting polygon triangulations is hard (Q2223620) (← links)
- The harmonic polytope (Q2238223) (← links)
- On the number of upward planar orientations of maximal planar graphs (Q2250457) (← links)
- Dichotomy results for fixed point counting in Boolean dynamical systems (Q2257296) (← links)
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms (Q2277131) (← links)
- Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph (Q2563513) (← links)
- Subtractive reductions and complete problems for counting complexity classes (Q2566034) (← links)
- Complexity and algorithms for computing Voronoi cells of lattices (Q3055167) (← links)
- A Dichotomy Theorem for Polynomial Evaluation (Q3182924) (← links)
- Complexity of the Bollobás-Riordan Polynomial (Q3503627) (← links)
- Connection Matrices for MSOL-Definable Structural Invariants (Q3601800) (← links)
- The Computational Complexity of the Tutte Plane: the Bipartite Case (Q4291212) (← links)
- On the computational complexity of the Jones and Tutte polynomials (Q4712248) (← links)
- (Q4714025) (← links)
- Harary polynomials (Q5056203) (← links)
- Acyclic polynomials of graphs (Q5080911) (← links)
- (Q5088963) (← links)
- (Q5095623) (← links)
- Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms (Q5130518) (← links)
- Short certificates for chromatic equivalence (Q5377353) (← links)
- Combinatorial Generation via Permutation Languages. V. Acyclic Orientations (Q6170445) (← links)
- Eigenpolytope Universality and Graphical Designs (Q6195955) (← links)
- Equality cases of the Alexandrov-Fenchel inequality are not in the polynomial hierarchy (Q6642430) (← links)
