Tag: counting-complexity

Found 106 results for 'counting-complexity'.

1) cc.complexity-theory - Complexity of counting poset automorphisms
2) cc.complexity-theory - #P-complete problems are at least as hard as NP-complete problems
3) reference-request - Is counting simple cycles in $P$ for graphs of bounded tree width?
4) cc.complexity-theory - Complexity of counting graph endomorphisms
5) counting-complexity - Complexity of Model Enumeration in function free, equality free, First Order Logic with only Unary Predicates?
6) graph-theory - Is there a direct/natural reduction to count non-bipartite perfect matchings using the permanent?
7) cc.complexity-theory - Complexity of Uniform Generation of Perfect Matchings
8) cc.complexity-theory - Why is the reduction from 3-SAT to 3-dimensional Matching Parsimonious?
9) ds.algorithms - Number of subgraphs with a given number of nodes
10) counting-complexity - Complexity of counting matchings in a bipartite graph
11) reference-request - Easy problems with hard counting versions
12) cc.complexity-theory - Above #P and counting search problems
13) cc.complexity-theory - What do we know about the phase transition of #P-Complete problems?
14) cc.complexity-theory - Concrete examples of $\sharp P_1$ complete problems? Self avoiding walks?
15) cc.complexity-theory - How hard is it to count the number of local optima for a problem in PLS?
16) reference-request - Complexity of #SAT for monotone DNF formulae whose hypergraph is a hypertree
17) cc.complexity-theory - What's the complexity of Median-SAT?
18) cc.complexity-theory - Solution Clusters and Monotone-2SAT
19) cc.complexity-theory - Counting solutions of Monotone-2CNF formulas
20) cc.complexity-theory - Counting the number of Hamiltonian cycles in cubic Hamiltonian graphs?
21) ds.algorithms - Holographic Algorithms - Equivalence of Bases
22) cc.complexity-theory - Complexity of #PP2DNF where we also count on the number of clauses
23) complexity-classes - What's the complexity of counting odd nodes in graph?
24) cc.complexity-theory - Count satisfying assignments of CNF formulas over all possible negation assignments
25) cc.complexity-theory - Is the counting version of 1-in-3 Sat #P-complete?
26) ds.algorithms - What is known about counting bipartite perfect matching with average degree in $[2,3]$ and max degree $3$?
27) ds.algorithms - FPRAS for #P-complete problems
28) counting-complexity - Is it known whether counting $q$-dimensional $p$-matching is $\#W[1]$-Hard?
29) ds.algorithms - Number of subgraphs with given edge parity
30) ds.algorithms - The ODD EVEN DELTA problem
31) ds.algorithms - Counting the number of distinct s-t cuts in a oriented graph
32) np-hardness - Probability of generating a desired permutation by random swaps
33) sat - Counting the number of satisfying assignments in a POSITIVE CNF-SAT
34) cc.complexity-theory - What's the relationship between ASP-complete and #P-complete?
35) cc.complexity-theory - A counting subset sum problem with fixed subset size and bounded weights
36) cc.complexity-theory - Examples of hardness phase transitions
37) cc.complexity-theory - How hard is to compute $\Delta_{|V|}$?
38) cc.complexity-theory - Trees: complexity of counting the number of vertex covers
39) cc.complexity-theory - Lower and upper bounds on the diameter of 3-regular graphs obtained after reducing practical real world problem instances to #3-regular Vertex Cover
40) cc.complexity-theory - Easy decision hard counting Parametrized
41) cc.complexity-theory - Counting reduction from #SAT to #HornSAT?
42) cc.complexity-theory - When does "X is NP-complete" imply "#X is #P-complete"?
43) cc.complexity-theory - Log-space reduction from Parity-L to CNOT circuits?
44) cc.complexity-theory - Examples of #P problems which are in FP ?
45) ds.algorithms - FPRAS on #P complete problems and self reducibility
46) cc.complexity-theory - How can I show a Gap-P problem is outside #P
47) cc.complexity-theory - How hard is it to count the number of factors of an integer?
48) ds.algorithms - What are the current best upper bounds of #P?
49) np-hardness - Sampling a uniformly random satisfying assignment
50) complexity-classes - Complexity class for Optimization problems over #P functions