429 search results - page 85 / 86 » Turing computations on ordinals |
APPROX
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
CHARME
2001
Springer
13 years 10 months ago
2001
Springer
Formal analysis remains outside the mainstream of system design practice. Interactive methods and tools are regarded by some to be on the margin of useful research in this area. Al...
COCO
1991
Springer
13 years 9 months ago
1991
Springer
For various polynomial-time reducibilities r, this paper asks whether being r-reducible to a sparse set is a broader notion than being r-equivalent to a sparse set. Although distin...
ACL
1997
13 years 7 months ago
1997
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
CCR
2006
13 years 5 months ago
2006
If despite your better judgment you decide to read this article, keep in mind that it was written during the summer, and this has been the hottest summer ever. To avoid such artic...