19 search results - page 2 / 4 » Strong Reductions and Isomorphism of Complete Sets |
FSTTCS
2001
Springer
14 years 1 months ago
2001
Springer
For any class C und closed under NC1 reductions, it is shown that all sets complete for C under first-order (equivalently, Dlogtimeuniform AC0 ) reductions are isomorphic under ...
ECCC
2006
13 years 8 months ago
2006
Under the assumption that NP does not have p-measure 0, we investigate reductions to NP-complete sets and prove the following: (1) Adaptive reductions are more powerful than nonad...
IPL
2008
13 years 8 months ago
2008
Abstract. We establish linear-time reductions between the minimization of a deterministic finite automaton (DFA) and the conjunction of 3 subproblems: the minimization of a strongl...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
This is a set of lecture notes that developed out of courses on the lambda calculus that I taught at the University of Ottawa in 2001 and at Dalhousie University in 2007. Topics c...
JUCS
2011
13 years 3 months ago
2011
: An OCR free word spotting method is developed and evaluated under a strong experimental protocol. Different feature sets are evaluated under the same experimental conditions. In ...