2168 search results - page 49 / 434 » Randomized Algorithms and Complexity Theory |
124
Voted
ISAAC
2005
Springer
15 years 8 months ago
2005
Springer
We characterize the gap between time and space complexity of functions by operators and completeness. First, we introduce a new notion of operators for function complexity classes ...
106
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
The classical zero-one law for first-order logic on random graphs says that for every first-order property in the theory of graphs and every p (0, 1), the probability that the r...
170
Voted
MOBIHOC
2004
ACM
16 years 2 months ago
2004
ACM
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
116
Voted
JSC
2010
15 years 1 months ago
2010
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
137
click to vote
COLT
2006
Springer
15 years 6 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...