13603 search results - page 157 / 2721 » On the Complexity of Computing Treelength |
COGSCI
2010
13 years 9 months ago
2010
We examine the verification of simple quantifiers in natural language from a computational model perspective. We refer to previous neuropsychological investigations of the same pr...
MFCS
1989
Springer
14 years 1 months ago
1989
Springer
In this paper we review the key results about space bounded complexity classes, discuss the central open problems and outline the prominent proof techniques. We show that, for a s...
IPPS
1998
IEEE
14 years 1 months ago
1998
IEEE
The increasing size and complexity of high-performance applications have motivated a new round of innovation related to configuration, build, and launch of applications for large ...
GECCO
2005
Springer
14 years 3 months ago
2005
Springer
The interaction among variables of an optimization problem is known as epistasis, and its degree is an important measure for the nonlinearity of the problem. We address the proble...
CRYPTO
2001
Springer
14 years 2 months ago
2001
Springer
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...