Counting complexity
From MaRDI portal
Recommendations
Cited in
(32)- Relating polynomial time to constant depth
- An oracle builder's toolkit
- On the algebraic complexity of some families of coloured Tutte polynomials
- A second step towards complexity-theoretic analogs of Rice's Theorem
- Relativized worlds with an infinite hierarchy
- The counting power of P systems with antimatter
- Simulating counting oracles with cooperation
- On the probabilistic closure of the loose unambiguous hierarchy
- Generality's price: Inescapable deficiencies in machine-learned programs
- The complexity of counting problems
- Complexity dichotomies of counting problems
- Counting Value Sets: Algorithm and Complexity
- Complexity of Counting the Optimal Solutions
- On Toda’s Theorem in Structural Communication Complexity
- On a theorem of Razborov
- scientific article; zbMATH DE number 850077 (Why is no real title available?)
- On the counting complexity of mathematical nanosciences
- Descriptive complexity for counting complexity classes
- The size of SPP
- Complexity limitations on one-turn quantum refereed games
- Effective Poset Inequalities
- Computational complexity of counting coincidences
- On the fine-grained complexity of parity problems
- Power of counting by nonuniform families of polynomial-size finite automata
- Signed combinatorial interpretations in algebraic combinatorics
- Estimating the expected social welfare and cost of random serial dictatorship
- Lower bounds and the hardness of counting properties
- Closure properties and characterizations of TotP
- Counting martingales for measure and dimension in complexity classes
- What is a \textit{polynomial-time} computable square-integrable function?
- Complexity of counting the optimal solutions
- Efficient verification of Tunnell's criterion
This page was built for publication: Counting complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4359457)
