Lower Bounds on Query Complexity for Testing Bounded-Degree CSPs

Yuichi Yoshida. Lower Bounds on Query Complexity for Testing Bounded-Degree CSPs. In Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, June 8-10, 2011. pages 34-44, IEEE Computer Society, 2011. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.