AI Chat AI Image Generator AI Video Text to Speech

Consequences of APSP, triangle detection, and 3SUM hardness for separation between determinism and non-determinism

11/04/2020

∙

by Andrzej Lingas, et al.

∙

∙

We present implications from the known conjectures like APSP, 3SUM and ETH in a form of a negated containment of a linear-time with a non-deterministic logarithmic-bit oracle in a respective deterministic bounded-time class They are different for different conjectures and they exhibit in particular the dependency on the input range parameters.

page 1

page 2

page 3

page 4

research

∙ 07/04/2021

The PCP-like Theorem for Sub-linear Time Inapproximability

In this paper we propose the PCP-like theorem for sub-linear time inappr...

0 Hengzhao Ma, et al. ∙

research

∙ 06/03/2021

Deterministic Weighted Expander Decomposition in Almost-linear Time

In this note, we study the expander decomposition problem in a more gene...

0 Jason Li, et al. ∙

research

∙ 03/09/2023

Range Avoidance for Constant-Depth Circuits: Hardness and Algorithms

Range Avoidance (AVOID) is a total search problem where, given a Boolean...

0 Karthik Gajulapalli, et al. ∙

research

∙ 10/21/2022

Unbalanced Triangle Detection and Enumeration Hardness for Unions of Conjunctive Queries

We study the enumeration of answers to Unions of Conjunctive Queries (UC...

0 Karl Bringmann, et al. ∙

research

∙ 07/14/2023

A simple deterministic near-linear time approximation scheme for transshipment with arbitrary positive edge costs

We describe a simple deterministic near-linear time approximation scheme...

0 Emily Fox, et al. ∙

research

∙ 12/26/2021

Tree exploration in dual-memory model

We study the problem of online tree exploration by a deterministic mobil...

0 Dominik Bojko, et al. ∙

research

∙ 11/03/2021

Effective guessing has unlikely consequences

A classic result of Paul, Pippenger, Szemerédi and Trotter states that D...

0 András Z. Salamon, et al. ∙