1450 search results - page 52 / 290 » On the Complexity of Hardness Amplification |
AAAI
2008
13 years 11 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
ACID
2006
13 years 10 months ago
2006
The r-Regular Induced Subgraph problem asks, given a graph G and a nonnegative integer k, whether G contains an r-regular induced subgraph of size at least k, that is, an induced ...
AAAI
1998
13 years 10 months ago
1998
This paperconsidersthe problem of representingcomplex systems that evolve stochastically over time. Dynamic Bayesian networks provide a compact representation for stochastic proce...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We consider approximating the minmax value of a multiplayer game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with...
ECCC
2008
13 years 9 months ago
2008
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...