No label defined (Q5095623)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7569987

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7569987

Statements

scholarly article

0 references

0 references

Chicago Journal of Theoretical Computer Science

0 references

publication date

10 August 2022

0 references

full work available at URL

https://arxiv.org/abs/1909.03339

0 references

zbMATH Keywords

counting complexity

0 references

feedback arc sets

0 references

\#P

0 references

counting minimum solutions

0 references

MaRDI profile type

MaRDI publication profile

0 references

PP is closed under truth-table reductions

0 references

0 references

Complexity of counting the optimal solutions

0 references

The Complexity of Planar Counting Problems

0 references

Reducibility among Combinatorial Problems

0 references

Hard Enumeration Problems in Geometry and Combinatorics

0 references

On closure properties of \(\#\text{P}\) in the context of \(\text{PF} \circ \#\text{P}\)

0 references

A complexity theory for feasible closure properties

0 references

The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected

0 references

On enumerating all minimal solutions of feedback problems

0 references

Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P

0 references

The complexity of computing the permanent

0 references

The Complexity of Enumeration and Reliability Problems

0 references

Identifiers

10.4086/cjtcs.2022.001

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5095623

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5095623&oldid=36840224"