179 search results - page 12 / 36 » eccc 2010 |
ECCC
2010
13 years 2 months ago
2010
Consider a graph obtained by taking an edge disjoint union of k complete bipartite graphs.
ECCC
2006
13 years 7 months ago
2006
We formulate a formal syntax of approximate formulas for the logic with counting quantifiers, SOLP, studied by us in [1], where we showed the following facts: (i) In the presence ...
ECCC
2006
13 years 7 months ago
2006
In our problem we are given a set of customers, their positions on the plane and their demands. Geometrically, the area covered by a directional antenna with parameters , ,
ECCC
2007
13 years 7 months ago
2007
Abstract. Motivated by a study of Zimand (22nd CCC, 2007), we consider the average-case complexity of property testing (focusing, for clarity, on testing properties of Boolean stri...
ECCC
2010
13 years 7 months ago
2010
We express some criticism about the definition of an algorithmic sufficient statistic and, in particular, of an algorithmic minimal sufficient statistic. We propose another defini...