Andrej Bogdanov, Luca Trevisan. Lower Bounds for Testing Bipartiteness in Dense Graphs. In 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 21-24 June 2004, Amherst, MA, USA. pages 75-81, IEEE Computer Society, 2004. [doi]
Abstract is missing.