709 search results - page 63 / 142 » On LR(k)-Parsers of Polynomial Size |
CORR
2007
Springer
14 years 10 months ago
2007
Springer
– We present a methodology for proving termination of left-linear term rewriting systems (TRSs) by using Albert Burroni’s polygraphs, a kind of rewriting systems on algebraic c...
CC
2005
Springer
14 years 9 months ago
2005
Springer
We study the complexity of constructing pseudorandom generators (PRGs) from hard functions, focussing on constant-depth circuits. We show that, starting from a function f : {0, 1}l...
SIAMMAX
2011
14 years 4 months ago
2011
Rational eigenvalue problems (REPs) are an emerging class of nonlinear eigenvalue problems that arise from a variety of physical applications. In this paper, we propose a lineariz...
STOC
2012
ACM
13 years 10 days ago
2012
ACM
We analyze the Schelling model of segregation in which a society of n individuals live in a ring. Each individual is one of two races and is only satisfied with his location so l...
STOC
2012
ACM
13 years 10 days ago
2012
ACM
This work deals with the power of linear algebra in the context of multilinear computation. By linear algebra we mean algebraic branching programs (ABPs) which are known to be com...