scientific article; zbMATH DE number 3568040
From MaRDI portal
Publication:4139697
Cited in
(27)- The complexity of counting homeomorphs
- Space-bounded hierarchies and probabilistic computations
- Random generation of combinatorial structures from a uniform distribution
- NP is as easy as detecting unique solutions
- Some observations on the connection between counting and recursion
- Discrete extremal problems
- On tape-bounded probabilistic Turing machine acceptors
- Division in idealized unit cost RAMs
- Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis
- A survey of space complexity
- Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P
- Logarithmic advice classes
- On sparse hard sets for counting classes
- Complexity of DNA sequencing by hybridization.
- Enumerative counting is hard
- Randomised algorithms
- The complexity of approximating bounded-degree Boolean \(\#\)CSP
- The complexity of counting edge colorings for simple graphs
- The odds of staying on budget
- On the power of parity polynomial time
- Multihead two-way probabilistic finite automata (extended abstract)
- Counting and enumeration complexity with application to multicriteria scheduling
- On measuring inconsistency in definite and indefinite databases with denial constraints
- Complexity and enumeration in models of genome rearrangement
- Decreasing the bandwidth of a transition matrix
- On measuring inconsistency in graph databases with regular path constraints
- Nash equilibria in discrete routing games with convex latency functions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4139697)
