Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Andrej Bogdanov. Lower Bounds for Testing Bipartiteness in Dense Graphs. Electronic Colloquium on Computational Complexity (ECCC), (064), 2002. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Lower Bounds for Testing Bipartiteness in Dense GraphsAndrej Bogdanov, Luca Trevisan. cocoon 2004: 75-81 [doi]
The following publications are possibly variants of this publication: