1445 search results - page 48 / 289 » Uniformly Hard Languages |
ECCC
1998
13 years 9 months ago
1998
Impagliazzo and Wigderson IW97] have recently shown that if there exists a decision problem solvable in time 2O(n) and having circuit complexity 2 (n) (for all but nitely many n) ...
FINTAL
2006
14 years 1 months ago
2006
This paper addresses a problem of natural language text alignment, from a humanities discipline called textual genetic criticism where different text versions must be compared. The...
STACS
2010
Springer
14 years 4 months ago
2010
Springer
This paper presents the following results on sets that are complete for NP. (i) If there is a problem in NP that requires 2nΩ(1) time at almost all lengths, then every many-one N...
JLP
2008
13 years 8 months ago
2008
Coordination languages were introduced in the early 80's as programming notations to manage the interaction among concurrent collaborating software entities. Process algebras...
HYBRID
2004
Springer
14 years 3 months ago
2004
Springer
We present a new high-level programming language, called XGIOTTO, for programming applications with hard real-time constraints. Like its predecessor, XGIOTTO is based on the LET (l...