„Counting complexity“
Suchergebnisse
182 Treffer
-
Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial
-
From an Odd Arity Signature to a Holant Dichotomy
-
Counting Martingales for Measure and Dimension in Complexity Classes
-
Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs
-
P-Time Algorithms for Typical #EO Problems
-
Parameterised Holant Problems
-
Triangle Counting in Dynamic Graph Streams
-
A Fixed-Parameter Perspective on #BIS
-
Counting Linear Extensions: Parameterizations by Treewidth
-
A Complexity Trichotomy for Approximately Counting List H-Colourings
-
The complexity of approximating conservative counting CSPs
-
Computational Counting (Dagstuhl Seminar 13031)
-
Counting Edge-Injective Homomorphisms and Matchings on Restricted Graph Classes
-
#BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region
-
Log-supermodular functions, functional clones and counting CSPs
-
Descriptive Complexity of #AC^0 Functions
-
Spherical Box-Counting: Combining 360° Panoramas with Fractal Analysis
-
A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs
-
The Relative Strength of #SAT Proof Systems
-
BQP, Meet NP: Search-To-Decision Reductions and Approximate Counting