709 search results - page 34 / 142 » On LR(k)-Parsers of Polynomial Size |
CORR
2007
Springer
15 years 1 months ago
2007
Springer
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
AAECC
2000
Springer
15 years 1 months ago
2000
Springer
Computing only the low degree terms of the product of two univariate polynomials is called a short multiplication. By decomposition into subproblems, a short multiplication can be ...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We consider the problem of designing a revenue-maximizing auction for a single item, when the values of the bidders are drawn from a correlated distribution. We observe that there...
105
click to vote
DATE
2007
IEEE
15 years 7 months ago
2007
IEEE
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...
113
click to vote
ADG
2000
Springer
15 years 5 months ago
2000
Springer
In this paper we propose a bracket algebra based elimination method for automated generation of readable proofs for theorems in incidence geometry. This method is based on two tech...