4 search results - page 1 / 1 » Note on Counting Eulerian Circuits |
CORR
2004
Springer
13 years 9 months ago
2004
Springer
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
CSL
2010
Springer
13 years 10 months ago
2010
Springer
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...