Pages that link to "Item:Q4210088"
From MaRDI portal
The following pages link to The Complexity of Planar Counting Problems (Q4210088):
Displaying 30 items.
- Manipulating the quota in weighted voting games (Q420828) (← links)
- Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems (Q549709) (← links)
- On unique graph 3-colorability and parsimonious reductions in the plane (Q596079) (← links)
- Algorithms for four variants of the exact satisfiability problem (Q596105) (← links)
- On the complexity of generalized chromatic polynomials (Q679542) (← links)
- Counting independent sets in tree convex bipartite graphs (Q730492) (← links)
- Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594) (← links)
- The complexity of the \(K\)th largest subset problem and related problems (Q894449) (← links)
- Errata for the paper ``Predecessor existence problems for finite discrete dynamical systems''. (Q924687) (← links)
- Partition into cliques for cubic graphs: Planar case, complexity and approximation (Q947111) (← links)
- On symmetric signatures in holographic algorithms (Q968267) (← links)
- The complexity of power-index comparison (Q1001906) (← links)
- The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. (Q1401394) (← links)
- Some observations on holographic algorithms (Q1616615) (← links)
- The fewest clues problem (Q1623268) (← links)
- On the construction of graphs with a planar bipartite double cover from Boolean formulas and its application to counting satisfying solutions (Q1704571) (← links)
- Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible (Q2196563) (← links)
- Path puzzles: discrete tomography with a path constraint is hard (Q2308497) (← links)
- Computational complexity of counting problems on 3-regular planar graphs (Q2382289) (← links)
- Predecessor existence problems for finite discrete dynamical systems (Q2455591) (← links)
- Computational aspects of mining maximal frequent patterns (Q2508965) (← links)
- Counting dominating sets in some subclasses of bipartite graphs (Q2672635) (← links)
- Rectangular spiral galaxies are still hard (Q2678258) (← links)
- (Q4501524) (← links)
- Fast and simple algorithms for counting dominating sets in distance-hereditary graphs (Q5012812) (← links)
- (Q5095623) (← links)
- Planar 3-SAT with a clause/variable cycle (Q5116495) (← links)
- Counting dominating sets in generalized series-parallel graphs (Q5207508) (← links)
- ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHS (Q5493901) (← links)
- The Complexity of Aggregates over Extractions by Regular Expressions (Q6135782) (← links)