1379 search results - page 99 / 276 » The Complexity of the Annihilating Polynomial |
155
click to vote
AI
2002
Springer
15 years 6 months ago
2002
Springer
ko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, th...
150
click to vote
TCOM
2010
15 years 4 months ago
2010
Abstract—This paper investigates the distribution of the condition number of complex Wishart matrices. Two closely related measures are considered: the standard condition number ...
212
click to vote
PODS
2012
ACM
13 years 8 months ago
2012
ACM
Data is increasingly being bought and sold online, and Webbased marketplace services have emerged to facilitate these activities. However, current mechanisms for pricing data are ...
163
click to vote
ISAAC
2009
Springer
16 years 26 days ago
2009
Springer
We study the following question, communicated to us by Mikl´os Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0, 1}w )3 → {0, 1}w be computed by word...
153
click to vote
SAGT
2009
Springer
16 years 26 days ago
2009
Springer
Abstract. We continue the recently initiated study of the computational aspects of weak saddles, an ordinal set-valued solution concept proposed by Shapley. Brandt et al. gave a po...