Pages that link to "Item:Q2784460"
From MaRDI portal
The following pages link to The complexity of counting in sparse, regular, and planar graphs (Q2784460):
Displaying 50 items.
- Sequential Monte Carlo for counting vertex covers in general graphs (Q294226) (← links)
- Approximately counting locally-optimal structures (Q295655) (← links)
- Holant problems for 3-regular graphs with complex edge functions (Q315538) (← links)
- Proof systems and transformation games (Q354613) (← links)
- On planar Toeplitz graphs (Q367045) (← links)
- Closest pair and the post office problem for stochastic points (Q390124) (← links)
- Partition functions on \(k\)-regular graphs with \(\{0,1\}\)-vertex assignments and real edge functions (Q391089) (← links)
- The complexity of complex weighted Boolean \#CSP (Q395011) (← links)
- The complexity of generalized domino tilings (Q396923) (← links)
- Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs (Q401479) (← links)
- An exact exponential time algorithm for counting bipartite cliques (Q436594) (← links)
- Computing cooperative solution concepts in coalitional skill games (Q490424) (← links)
- Stochastic enumeration method for counting trees (Q518856) (← links)
- A computational proof of complexity of some restricted counting problems (Q534558) (← links)
- Algorithms for four variants of the exact satisfiability problem (Q596105) (← links)
- Holographic algorithms: from art to science (Q619900) (← links)
- Edge flipping in graphs (Q651046) (← links)
- Spin systems on \(k\)-regular graphs with complex edge functions (Q690458) (← links)
- Counting independent sets in tree convex bipartite graphs (Q730492) (← links)
- Counting and enumerating independent sets with applications to combinatorial optimization problems (Q784784) (← links)
- The challenges of unbounded treewidth in parameterised subgraph counting problems (Q897601) (← links)
- Fair cost allocations under conflicts - a game-theoretic point of view - (Q924627) (← links)
- Counting the number of independent sets in chordal graphs (Q935840) (← links)
- Exact algorithms for exact satisfiability and number of perfect matchings (Q958212) (← links)
- Sampling Eulerian orientations of triangular lattice graphs (Q1026226) (← links)
- On counting 3-D matchings of size \(k\) (Q1040648) (← links)
- The complexity of counting homeomorphs (Q1058852) (← links)
- Counting trees in a graph is \(\# \text{P}\)-complete (Q1332763) (← 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)
- Block interpolation: a framework for tight exponential-time counting complexity (Q1640999) (← links)
- On the construction of graphs with a planar bipartite double cover from Boolean formulas and its application to counting satisfying solutions (Q1704571) (← links)
- The complexity of Bayesian networks specified by propositional and relational languages (Q1711881) (← links)
- Counting minimal transversals of \(\beta\)-acyclic hypergraphs (Q1713476) (← links)
- Counting independent sets in cocomparability graphs (Q1721932) (← links)
- Counting models for 2SAT and 3SAT formulae (Q1770390) (← links)
- Holographic reduction, interpolation and hardness (Q1926111) (← links)
- Holographic algorithms by Fibonacci gates (Q1931762) (← links)
- Holographic reduction for some counting problems (Q1944130) (← links)
- The complexity of planar Boolean \#CSP with complex weights (Q2009629) (← links)
- Parameterized counting of partially injective homomorphisms (Q2032353) (← links)
- Counting subset repairs with functional dependencies (Q2221807) (← links)
- Counting polygon triangulations is hard (Q2223620) (← links)
- The complexity of counting edge colorings for simple graphs (Q2232603) (← links)
- Dichotomy results for fixed point counting in Boolean dynamical systems (Q2257296) (← links)
- A fixed-parameter perspective on \#BIS (Q2272593) (← links)
- Counting edge-injective homomorphisms and matchings on restricted graph classes (Q2321927) (← links)
- On the spectrum and number of convex sets in graphs (Q2339431) (← links)
- Expected computations on color spanning sets (Q2343982) (← links)
- Computational complexity of counting problems on 3-regular planar graphs (Q2382289) (← links)
