10608 search results - page 43 / 2122 » Complexity of O'Hara's Algorithm |
SODA
2012
ACM
13 years 3 months ago
2012
ACM
120
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
119
Voted
TEC
2010
14 years 7 months ago
2010
Abstract--In 1968, Volker Strassen, a young German mathematician, announced a clever algorithm to reduce the asymptotic complexity of n
83
Voted
NSDI
2008
15 years 3 months ago
2008
The systems and networking community treasures "simple" system designs, but our evaluation of system simplicity often relies more on intuition and qualitative discussion...
101
click to vote
APPROX
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...