19320 search results - page 174 / 3864 » On the complexity of computing determinants |
156
click to vote
DAGSTUHL
2004
15 years 8 months ago
2004
If Alice has x, y, Bob has x, z and Carol has y, z can they determine if x + y + z = N? They can if (say) Alice broadcasts x to Bob and Carol; can they do better? Chandra, Furst, a...
156
click to vote
PRIS
2004
15 years 7 months ago
2004
Several authors have theoretically determined distribution-free bounds on sample complexity. Formulas based on several learning paradigms have been presented. However, little is kn...
175
click to vote
COLING
1992
15 years 7 months ago
1992
Analysisof a corpus of queries to a statistical database has shown considerable variation in the location and order of modifiers in complex noun phrases. Nevertheless, restriction...
167
click to vote
AIPS
2009
15 years 7 months ago
2009
A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is well-founded since k is a constant for all but...
154
click to vote
AML
2007
15 years 6 months ago
2007
Abstract. This research is motivated by the program of Reverse Mathematics. We investigate basic part of complex analysis within some weak subsystems of second order arithmetic, in...