10608 search results - page 43 / 2122 » Complexity of O'Hara's Algorithm |
SODA
2012
ACM
12 years 10 days ago
2012
ACM
STOC
2009
ACM
14 years 10 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...
TEC
2010
13 years 4 months ago
2010
Abstract--In 1968, Volker Strassen, a young German mathematician, announced a clever algorithm to reduce the asymptotic complexity of n
NSDI
2008
14 years 7 days 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...
APPROX
2006
Springer
14 years 1 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...