The Parameterized Complexity of the k -Biclique Problem
type: Item
instance of: scholarly article
title: The Parameterized Complexity of the k -Biclique Problem
zbMATH Open document ID: 1426.68131
DOI: 10.1145/3212622
author: Bingkai Lin
published in: Journal of the ACM
publication date: 2019-02-25T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7029219
zbMATH Keywords: biclique
zbMATH Keywords: exponential time hypothesis
zbMATH Keywords: maximum \(k\)-subset intersection
zbMATH Keywords: Weil's character sum theorem
zbMATH Keywords: dichotomy theorem
zbMATH Keywords: parameterized inapproximability
zbMATH Keywords: probabilistic method
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1145/3212622
OpenAlex ID: W2893188841
description: scientific article; zbMATH DE number 7029219