597 search results - page 3 / 120 » New Algorithms for Improved Transcendental Functions on IA-6... |
STOC
2005
ACM
14 years 7 months ago
2005
ACM
We present a new constant round protocol for non-malleable zero-knowledge. Using this protocol as a subroutine, we obtain a new constant-round protocol for non-malleable commitmen...
SAT
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We introduce a new conceptual model for representing and designing Stochastic Local Search (SLS) algorithms for the propositional satisfiability problem (SAT). Our model...
CSB
2005
IEEE
14 years 29 days ago
2005
IEEE
With hierarchical clustering methods, divisions or fusions, once made, are irrevocable. As a result, when two elements in a bottom-up algorithm are assigned to one cluster, they c...
DAC
2003
ACM
14 years 8 months ago
2003
ACM
Structuring and mapping of a Boolean function is an important problem in the design of complex integrated circuits. Libraryaware constructive decomposition offers a solution to th...
STOC
2010
ACM
13 years 11 months ago
2010
ACM
We give a new construction of pseudorandom generators from any one-way function. The construction achieves better parameters and is simpler than that given in the seminal work of ...