scientific article; zbMATH DE number 7569987
From MaRDI portal
Publication:5095623
DOI10.4086/cjtcs.2022.001OpenAlexW4226367151MaRDI QIDQ5095623
Publication date: 10 August 2022
Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.03339
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- The complexity of computing the permanent
- Complexity of counting the optimal solutions
- Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P
- On enumerating all minimal solutions of feedback problems
- On closure properties of \(\#\text{P}\) in the context of \(\text{PF} \circ \#\text{P}\)
- PP is closed under truth-table reductions
- A complexity theory for feasible closure properties
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- Hard Enumeration Problems in Geometry and Combinatorics
- The Complexity of Enumeration and Reliability Problems
- The Complexity of Planar Counting Problems
- Reducibility among Combinatorial Problems
This page was built for publication:
