52 search results - page 5 / 11 » Average-case Complexity |
FOCS
2003
IEEE
14 years 3 months ago
2003
IEEE
We show that if an NP-complete problem has a non-adaptive self-corrector with respect to a samplable distribution then coNP is contained in NP/poly and the polynomial hierarchy co...
CONPAR
1992
14 years 1 months ago
1992
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
ICS
2010
Tsinghua U.
14 years 7 months ago
2010
Tsinghua U.
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
CPM
2009
Springer
14 years 4 months ago
2009
Springer
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...
FCT
2007
Springer
14 years 1 months ago
2007
Springer
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...