Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > YONATAN NAKAR:
All reports by Author Yonatan Nakar:

TR18-185 | 6th November 2018
Yonatan Nakar, Dana Ron

On the Testability of Graph Partition Properties

In this work we study the testability of a family of graph partition properties that generalizes a family previously studied by Goldreich, Goldwasser, and Ron (Journal of the ACM, 1998). While the family studied by Goldreich et al. includes a variety of natural properties, such as k-colorability and containing a ... more >>>




ISSN 1433-8092 | Imprint