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 40 items.
- The computational complexity of random serial dictatorship (Q2453028) (← links)
- Predecessor existence problems for finite discrete dynamical systems (Q2455591) (← links)
- Computational aspects of mining maximal frequent patterns (Q2508965) (← links)
- Using binary patterns for counting falsifying assignments of conjunctive forms (Q2520658) (← links)
- Minimal autocatalytic networks (Q2635148) (← links)
- A complete dichotomy rises from the capture of vanishing signatures (Q2817798) (← links)
- Counting Maximal Independent Sets in Subcubic Graphs (Q2891379) (← links)
- A graph polynomial for independent sets of bipartite graphs (Q2911069) (← links)
- Counting Minimal Dominating Sets (Q2988832) (← links)
- Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width (Q3010427) (← links)
- Counting Independent Sets in Claw-Free Graphs (Q3104779) (← links)
- Approximately Counting Locally-Optimal Structures (Q3448823) (← links)
- Model Counting of Monotone Conjunctive Normal Form Formulas with Spectra (Q3466783) (← links)
- FAST EXPONENTIAL-TIME ALGORITHMS FOR THE FOREST COUNTING AND THE TUTTE POLYNOMIAL COMPUTATION IN GRAPH CLASSES (Q3620613) (← links)
- Counting matchings with \(k\) unmatched vertices in planar graphs (Q4606302) (← links)
- A Graph Theoretic Approach to Solve Special Knapsack Problems in Polynomial Time (Q4685763) (← links)
- The complexity of computing the number of self-avoiding walks in two-dimensional grid graphs and in hypercube graphs (Q4779175) (← links)
- Counting problems in parameterized complexity (Q5009461) (← links)
- Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model (Q5009783) (← links)
- The Complexity of Approximately Counting Retractions to Square-free Graphs (Q5032031) (← links)
- A Method for Computing the Merrifield–Simmons Index on Benzenoid Systems (Q5050764) (← links)
- (Q5088963) (← links)
- Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle (Q5089159) (← links)
- (Q5091009) (← links)
- Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices (Q5111752) (← links)
- Planar 3-SAT with a clause/variable cycle (Q5116495) (← links)
- (Q5159424) (← links)
- Classification of a Class of Counting Problems Using Holographic Reductions (Q5323095) (← links)
- ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHS (Q5493901) (← links)
- Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP (Q5737812) (← links)
- Maximum box problem on stochastic points (Q5918465) (← links)
- Dichotomy result on 3-regular bipartite non-negative functions (Q5918629) (← links)
- Bipartite 3-regular counting problems with mixed signs (Q5918683) (← links)
- Dichotomy result on 3-regular bipartite non-negative functions (Q5925621) (← links)
- Bipartite 3-regular counting problems with mixed signs (Q5925701) (← links)
- Counting independent sets in graphs with bounded bipartite pathwidth (Q6074656) (← links)
- Zeros, chaotic ratios and the computational complexity of approximating the independence polynomial (Q6198132) (← links)
- Cutting Barnette graphs perfectly is hard (Q6589850) (← links)
- Exponential time complexity of the complex weighted Boolean \#CSP (Q6591459) (← links)
- Computational complexity of counting coincidences (Q6614012) (← links)