An approximation hardness result for bipartite Clique

André Lanka, Andreas Goerdt. An approximation hardness result for bipartite Clique. Electronic Colloquium on Computational Complexity (ECCC), (048), 2004. [doi]

Abstract

Abstract is missing.