709 search results - page 24 / 142 » On LR(k)-Parsers of Polynomial Size |
ARITH
2003
IEEE
15 years 3 months ago
2003
IEEE
We aim at evaluating elementary and special functions using small tables and small, rectangular, multipliers. To do that, we show how accurate polynomial approximations whose orde...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
The value of a finite-state two-player zero-sum stochastic game with limit-average payoff can be approximated to within in time exponential in a polynomial in the size of the gam...
DAM
2008
14 years 9 months ago
2008
We prove that binary decision diagrams [1] can be polynomially simulated by the extended resolution rule of [2]. More precisely, for any unsatisfiable formula , there exists an ex...
ENTCS
2006
14 years 9 months ago
2006
We are concerned with programs composed of cooperative threads whose execution proceeds in synchronous rounds called instants. We develop static analysis methods to guarantee that...
111
click to vote
NMR
2004
Springer
15 years 3 months ago
2004
Springer
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance bo...