1445 search results - page 7 / 289 » Uniformly Hard Languages |
ICALP
2000
Springer
15 years 5 months ago
2000
Springer
JCSS
2006
15 years 1 months ago
2006
Resolving an issue open since Fenner, Fortnow, and Kurtz raised it in [FFK94], we prove that LWPP is not uniformly gap-definable and that WPP is not uniformly gap-definable. We do...
116
click to vote
PLDI
2006
ACM
15 years 7 months ago
2006
ACM
Applications written in unsafe languages like C and C++ are vulnerable to memory errors such as buffer overflows, dangling pointers, and reads of uninitialized data. Such errors ...
98
Voted
MFCS
2005
Springer
15 years 7 months ago
2005
Springer
This paper deals with balanced leaf language complexity classes, introduced independently in [1] and [14]. We propose the seed concept for leaf languages, which allows us to give ...
105
click to vote
COCOON
1999
Springer
15 years 6 months ago
1999
Springer
Cai and Selman [CS99] defined a modification of Levin’s notion of average polynomial time and proved, for every P-bi-immune language L and every polynomial-time computable dis...