„Counting complexity“
Suchergebnisse
182 Treffer
-
Parameterized Counting of Partially Injective Homomorphisms
-
Resolution with Counting: Dag-Like Lower Bounds and Different Moduli
-
Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness
-
A Faster Exact-Counting Protocol for Anonymous Dynamic Networks
-
Lower bounds for modular counting by circuits with modular gates
-
Counting Minimum Weight Arborescences
-
Improved Complexity Bounds for Counting Points on Hyperelliptic Curves
-
Conjunctive queries, arithmetic circuits and counting complexity
-
Counting, sampling and integrating: algorithms and complexity
-
Model Counting for CNF Formulas of Bounded Modular Treewidth
-
Counting Central Configurations at the Bifurcation Points
-
The deletion-contraction method for counting the number of spanning trees of graphs
-
On the connection between interval size functions and path counting
-
The Relative Exponential Time Complexity of Approximate Counting Satisfying Assignments
-
Counting, Sampling and Integrating: Algorithm and Complexity
-
Counting and Generating Permutations in Regular Classes
-
Complexity of Counting Components of Algebraic Varieties – Irreducible and Connected Components, Betti Numbers
-
The computational complexity of (XOR, AND) counting problems
-
On the complexity of counting irreducible components and computing Betti numbers of algebraic varieties
-
Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling