709 search results - page 40 / 142 » On LR(k)-Parsers of Polynomial Size |
ADCM
2008
14 years 10 months ago
2008
Abstract. Signals with finite rate of innovation are those signals having finite degrees of freedom per unit of time that specify them. In this paper, we introduce a prototypical s...
108
click to vote
ACTA
2007
14 years 10 months ago
2007
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
74
Voted
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We present an algorithm to perform a simultaneous modular reduction of several residues. This enables to compress polynomials into integers and perform several modular operations ...
114
click to vote
FSE
2011
Springer
14 years 1 months ago
2011
Springer
Hamsi is one of the 14 second-stage candidates in NIST’s SHA-3 competition. The only previous attack on this hash function was a very marginal attack on its 256-bit version publi...