ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Counting hierarchy”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.CCcs.CGTheoreticalRecentOct 7, 2026

$\exists \mathbb{R} \subseteq \textsf{CH}$

Alex Meiburg

The paper places the existential theory of the reals in the counting hierarchy and provides bounds for various problems.

View →
cs.CCmath.COTheoreticalRecentJun 28, 2026

On the Complexity of Counting Orderings in Graphs

Marcelo Arenas, María Alejandra Schild, Bernardo Subercaseaux

This paper shows #P-completeness for several graph counting problems using a new technique.

View →
math.COcs.CCTheoreticalRecentJul 21, 2026

Counting spanning quasi-trees of ribbon graphs: determinants and #P-completeness

William Whistler

This paper proves that counting quasi-trees in a connected ribbon graph is #P-complete.

View →
cs.DMTheoreticalRecentJun 12, 2026

The Genesis Sequence, Tree Records and Endofunctions

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…

View →
cs.CCTheoreticalRecentJul 4, 2026

Additional properties of parity based bit-counting complexity classes and hierarchies

Tayfun Pay

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.

View →
cs.CCcs.DMTheoreticalRecentJul 9, 2026

The Parameterised Complexity of Temporal Motif Counting, and a Lovász-Style Isomorphism Theorem

Jayakrishnan Madathil, Kitty Meeks, Marc Roth

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…

View →
math.COcs.DMq-bio.PETheoreticalRecentJun 12, 2026

Note on the Maximum Number of Trees Displayed by a Tree-Child Network

Yukihiro Murakami, Charles Semple

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.

View →
cs.DSEmpiricalRecentJun 15, 2026

Scalable K-clique Estimation with Differential Privacy

Dung Nguyen, Ritwick Mishra, Anil Vullikanti

This paper introduces a new algorithm for estimating $k$-clique counts with differential privacy, which is scalable and significantly faster than previous methods.

View →
cs.FLcs.DMTheoreticalRecentJun 9, 2026

On the Complexity of the Bi-infinite Post Correspondence Problem

Olivier Finkel, Vesa Halava

This paper studies the complexity of the bi-infinite Post Correspondence Problem with respect to the arithmetical hierarchy.

View →
math.COcs.IThep-thEmpiricalRecentJun 8, 2026

Finite-n Estimate of Dedekind Numbers by Layer-Ratio Monte Carlo

Tian-Shun Chen, Hao Feng, Haozhe Wang, Kilar Zhang

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.

View →
cs.DSmath.COTheoreticalRecentOct 19, 2026

A simplified proof of the FPRAS for counting perfect matchings

Chenghua Liu, Boning Meng

This paper simplifies the proof of OpenAI's FPRAS for counting perfect matchings in general graphs.

View →