92 search results - page 7 / 19 » Fine hierarchies and m-reducibilities in theoretical compute... |
CORR
2010
Springer
14 years 11 months ago
2010
Springer
This paper is a continuation of the study of topological properties of omega context free languages (-CFL). We proved in [Topological Properties of Omega Context Free Languages, T...
FOCS
2003
IEEE
15 years 4 months ago
2003
IEEE
This paper gives tight bounds on the cost of cache-oblivious searching. The paper shows that no cache-oblivious search structure can guarantee a search performance of fewer than l...
81
Voted
FOCS
2003
IEEE
15 years 4 months ago
2003
IEEE
We show that if an NP-complete problem has a non-adaptive self-corrector with respect to a samplable distribution then coNP is contained in NP/poly and the polynomial hierarchy co...
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
Recently, Mikołaj Boja´nczyk introduced a class of max-regular languages, an extension of regular languages of infinite words preserving many of its usual properties. This new c...
TCS
2010
14 years 10 months ago
2010
When representing DNA molecules as words, it is necessary to take into account the fact that a word u encodes basically the same information as its Watson-Crick complement θ(u), w...