1445 search results - page 98 / 289 » Uniformly Hard Languages |
STACS
2005
Springer
14 years 3 months ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
FOCS
2003
IEEE
14 years 3 months ago
2003
IEEE
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...
AMEC
2003
Springer
14 years 3 months ago
2003
Springer
Auctions define games of incomplete information for which it is often too hard to compute the exact Bayesian-Nash equilibrium. Instead, the infinite strategy space is often popu...
ALT
1997
Springer
14 years 2 months ago
1997
Springer
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is har...
FCT
2007
Springer
14 years 2 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...