6142 search results - page 170 / 1229 » The Complexity of Partition Functions |
207
click to vote
FSTTCS
1992
Springer
15 years 10 months ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
140
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this paper we provide new bounds on classical and quantum distributional communication complexity in the two-party, one-way model of communication. In the classical one-way mode...
152
click to vote
ITA
2008
15 years 6 months ago
2008
In this article, we study the complexity of drunken man infinite words. We show that these infinite words, generated by a deterministic and complete countable automaton, or equival...
147
click to vote
AFRICACRYPT
2010
Springer
15 years 11 months ago
2010
Springer
In this paper, we analyze the SHAvite-3-512 hash function, as proposed and tweaked for round 2 of the SHA-3 competition. We present cryptanalytic results on 10 out of 14 rounds of ...
217
click to vote
ISAAC
2005
Springer
15 years 12 months ago
2005
Springer
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...