8196 search results - page 113 / 1640 » Computational Modeling and Complexity Science |
COGSCI
2010
14 years 10 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...
SOFSEM
2001
Springer
15 years 2 months ago
2001
Springer
The class of weak parallel machines is interesting, because it contains some realistic parallel machine models, especially suitable for pipelined computations. We prove that a modi...
103
click to vote
FOCS
1991
IEEE
15 years 1 months ago
1991
IEEE
For sums of radicals Pk i=1 i di p i, where i; i are elements of some real algebraic number eld Q( ); di p i 2 R; we present a deterministic polynomial time algorithm to decide wh...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
WISE
2009
Springer
15 years 7 months ago
2009
Springer
