4860 search results - page 329 / 972 » SNPs Problems, Complexity, and Algorithms |
107
click to vote
STOC
2005
ACM
16 years 1 months ago
2005
ACM
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...
STOC
2009
ACM
16 years 1 months ago
2009
ACM
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
211
click to vote
TASE
2012
IEEE
13 years 8 months ago
2012
IEEE
— This paper presents new results on the formal design of distributed coordinating agents in a discrete-event framework. In this framework, agents are modeled to be individually ...
124
click to vote
STOC
2007
ACM
16 years 1 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
103
click to vote
ANTS
2006
Springer
15 years 4 months ago
2006
Springer
This paper offers numerical evidence for a conjecture that primality proving may be done in (log N)3+o(1) operations by examining the growth rate of quantities known as pseudosquar...