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]

Authors

André Lanka

This author has not been identified. Look up 'André Lanka' in Google

Andreas Goerdt

This author has not been identified. Look up 'Andreas Goerdt' in Google