Nearly Optimal Average-Case Complexity of Counting Bicliques Under SETH

by   Shuichi Hirahara, et al.

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.



There are no comments yet.


page 1

page 2

page 3

page 4


Faster Exponential Algorithm for Permutation Pattern Matching

The Permutation Pattern Matching problem asks, given two permutations σ ...

Hardness Amplification of Optimization Problems

In this paper, we prove a general hardness amplification scheme for opti...

Fine-grained reductions from approximate counting to decision

The main problems in fine-grained complexity are CNF-SAT, the Orthogonal...

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...

Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness

We study the problem #IndSub(P) of counting all induced subgraphs of siz...

Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders

Given a graph property Φ, we consider the problem 𝙴𝚍𝚐𝚎𝚂𝚞𝚋(Φ), where the ...

A graph theoretical approach to the firebreak locating problem

In the last decade, wildfires have become wider and more destructive. Th...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.