20 results for “Counting hierarchy”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
The paper places the existential theory of the reals in the counting hierarchy and provides bounds for various problems.
This paper shows #P-completeness for several graph counting problems using a new technique.
This paper proves that counting quasi-trees in a connected ribbon graph is #P-complete.
Enrica Duchi, Adrián Lillo, Pablo Puerto, Mercedes Rosas +1 more
The paper establishes bijections between tree records, girth of connected endofunctions, and genesis sequences, deriving generating functions for tree and forest record numbers using Cayley's tree fun…
The paper studies properties of parity based bit-counting complexity classes B|0|⊕P and B|1|⊕P, proves inclusions and closures, and shows they contain PH and are contained in CH.
This paper studies the structural expressivity and parameterized complexity of counting homomorphisms from small temporal patterns to large temporal graphs, proving a temporal Lovász-style theorem, in…
This paper proves that the number of distinct rooted binary phylogenetic trees displayed by a binary tree-child network with n leaves is at most 2^(n-1)-1, and shows that this upper bound is sharp.
This paper introduces a new algorithm for estimating $k$-clique counts with differential privacy, which is scalable and significantly faster than previous methods.
This paper studies the complexity of the bi-infinite Post Correspondence Problem with respect to the arithmetical hierarchy.
This paper recasts Dedekind's problem as a finite layer-ratio reconstruction problem and estimates the Dedekind number M(n) using reversible fixed-layer Markov chains.
This paper simplifies the proof of OpenAI's FPRAS for counting perfect matchings in general graphs.