2661 search results - page 135 / 533 » Quantum Complexity Classes |
133
click to vote
NIPS
2008
15 years 4 months ago
2008
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
124
click to vote
ICMAS
2000
15 years 4 months ago
2000
This paper investigates the computational complexity of a fundamental problem in multi-agent systems: given an environment together with a specification of some task, can we const...
142
click to vote
SODA
2000
ACM
15 years 4 months ago
2000
ACM
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
130
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Deciding whether a graph can be embedded in a grid using only unitlength edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a numbe...
109
click to vote
ECCC
2008
15 years 3 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...