Sciweavers

3384 search results - page 5 / 677
» More Testable Properties
Sort
View
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
14 years 9 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira
ECCC
2008
122views more  ECCC 2008»
13 years 8 months ago
Every Minor-Closed Property of Sparse Graphs is Testable
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
Itai Benjamini, Oded Schramm, Asaf Shapira
PROPERTYTESTING
2010
13 years 6 months ago
Some Recent Results on Local Testing of Sparse Linear Codes
We study the local testability of linear codes. We first reformulate this question in the language of tolerant linearity testing under a non-uniform distribution. We then study th...
Swastik Kopparty, Shubhangi Saraf
CORR
2010
Springer
80views Education» more  CORR 2010»
13 years 8 months ago
Separations of Matroid Freeness Properties
Properties of Boolean functions on the hypercube that are invariant with respect to linear transformations of the domain are among some of the most well-studied properties in the ...
Arnab Bhattacharyya, Elena Grigorescu, Jakob Nords...