1449 search results - page 69 / 290 » Self-Randomized Exponentiation Algorithms |
132
Voted
STOC
1994
ACM
15 years 6 months ago
1994
ACM
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
119
click to vote
COCO
2007
Springer
15 years 6 months ago
2007
Springer
Current constructions of efficient argument systems combine a short (polynomial size) PCP with a cryptographic hashing technique. We suggest an alternative approach for this probl...
101
Voted
AAAI
2007
15 years 5 months ago
2007
We present a CNF to Tree-of-BDDs (ToB) compiler with complexity at most exponential in the tree width. We then present algorithms for interesting queries on ToB. Although some of ...
117
click to vote
STRINGOLOGY
2008
15 years 4 months ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
125
Voted
JCP
2008
15 years 2 months ago
2008
In this paper, a technique to generate expander graphs using Cellular Automata (CA) has been presented. The special class of CA, known as the Two Predecessor Single Attractor Cellu...