6274 search results - page 52 / 1255 » From query complexity to computational complexity |
FSTTCS
2009
Springer
14 years 4 months ago
2009
Springer
We clarify the role of Kolmogorov complexity in the area of randomness extraction. We show that a computable function is an almost randomness extractor if and only if it is a Kolm...
ENDM
2006
13 years 10 months ago
2006
Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring proble...
ISB
2002
13 years 9 months ago
2002
Data Mining and Knowledge Discovery techniques proved to be efficient tools for variety of complex tasks in biology including DNA research. This paper presents implementation of th...
ICPR
2002
IEEE
14 years 11 months ago
2002
IEEE
A robust approach for extracting car license plate from images with complex background and relatively poor quality is presented in this paper. The approach focuses on dealing with...
CIE
2007
Springer
14 years 4 months ago
2007
Springer
We survey our current knowledge of circuit complexity of regular languages and we prove that regular languages that are in AC0 and ACC0 are all computable by almost linear size ci...