6142 search results - page 280 / 1229 » The Complexity of Partition Functions |
160
click to vote
ASIACRYPT
2007
Springer
16 years 11 days ago
2007
Springer
Unbalanced Feistel schemes with expanding functions are used to construct pseudo-random permutations from kn bits to kn bits by using random functions from n bits to (k − 1)n bit...
128
click to vote
ASPDAC
2005
ACM
15 years 11 months ago
2005
ACM
— With the rise in complexity of modern systems, designers are spending a significant time on at the system level of abstraction. This paper introduces Model Algebra, a formalis...
166
click to vote
SMA
2003
ACM
15 years 11 months ago
2003
ACM
The presented approach to discretization of functionally defined heterogeneous objects is oriented towards applications associated with numerical simulation procedures, for exampl...
153
click to vote
FOCS
1999
IEEE
15 years 10 months ago
1999
IEEE
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...
167
click to vote
SAT
2010
Springer
15 years 10 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...