159 search results - page 7 / 32 » Soft lambda-Calculus: A Language for Polynomial Time Computa... |
STOC
2010
ACM
13 years 11 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
ERCIMDL
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. A policy is a statement that an action is permitted or forbidden if certain conditions hold. We introduce a language for reasoning about policies called Rosetta. What mak...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We show several unconditional lower bounds for exponential time classes against polynomial time classes with advice, including:
IFIP
2004
Springer
14 years 26 days ago
2004
Springer
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We ...
EMNLP
2010
13 years 5 months ago
2010
In this paper, we present a novel approach to enhance hierarchical phrase-based machine translation systems with linguistically motivated syntactic features. Rather than directly ...