376 search results - page 9 / 76 » Betweenness Centrality : Algorithms and Lower Bounds |
STOC
2012
ACM
11 years 10 months ago
2012
ACM
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
ICRA
2008
IEEE
14 years 2 months ago
2008
IEEE
— We propose an inverse agreement control strategy for multiple nonholonomic agents that forces the team members to disperse in the workspace in a distributed manner. Both the ca...
STOC
2002
ACM
14 years 8 months ago
2002
ACM
: This paper gives two distinct proofs of an exponential separation between regular resolution and unrestricted resolution. The previous best known separation between these systems...