Nearly Optimal Average-Case Complexity of Counting Bicliques Under SETH

10/12/2020
by   Shuichi Hirahara, et al.
0

In this paper, we seek a natural problem and a natural distribution of instances such that any O(n^c-ϵ)-time algorithm fails to solve most instances drawn from the distribution, while the problem admits an n^c+o(1)-time algorithm that correctly solves all instances. Specifically, we consider the K_a,b counting problem in a random bipartite graph, where K_a,b is a complete bipartite graph for constants a and b. We proved that the K_a,b counting problem admits an n^a+o(1)-time algorithm if a≥ 8, while any n^a-ϵ-time algorithm fails to solve it even on random bipartite graph for any constant ϵ>0 under the Strong Exponential Time Hypotheis. Then, we amplify the hardness of this problem using the direct product theorem and Yao's XOR lemma by presenting a general framework of hardness amplification in the setting of fine-grained complexity.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/25/2021

Faster Exponential Algorithm for Permutation Pattern Matching

The Permutation Pattern Matching problem asks, given two permutations σ ...
research
08/27/2019

Hardness Amplification of Optimization Problems

In this paper, we prove a general hardness amplification scheme for opti...
research
07/14/2017

Fine-grained reductions from approximate counting to decision

The main problems in fine-grained complexity are CNF-SAT, the Orthogonal...
research
12/05/2008

An analysis of a random algorithm for estimating all the matchings

Counting the number of all the matchings on a bipartite graph has been t...
research
07/21/2023

On the Complexity of the Bipartite Polarization Problem: from Neutral to Highly Polarized Discussions

The Bipartite Polarization Problem is an optimization problem where the ...
research
03/18/2021

A graph theoretical approach to the firebreak locating problem

In the last decade, wildfires have become wider and more destructive. Th...
research
11/01/2022

Alternative polynomial-time algorithm for Bipartite Matching

If G is a bipartite graph, Hall's theorem <cit.> gives a condition for t...

Please sign up or login with your details

Forgot password? Click here to reset