Nondeterminisic Sublinear Time Has Measure 0 in P

01/17/2018
by   John M. Hitchcock, et al.
0

The measure hypothesis is a quantitative strengthening of the P != NP conjecture which asserts that NP is a nonnegligible subset of EXP. Cai, Sivakumar, and Strauss (1997) showed that the analogue of this hypothesis in P is false. In particular, they showed that NTIME[n^1/11] has measure 0 in P. We improve on their result to show that the class of all languages decidable in nondeterministic sublinear time has measure 0 in P. Our result is based on DNF width and holds for all four major notions of measure on P.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/22/2018

Polynomial-Time Random Oracles and Separating Complexity Classes

Bennett and Gill (1981) showed that P^A != NP^A != coNP^A for a random o...
research
07/16/2020

Substring Complexity in Sublinear Space

Shannon's entropy is a definitive lower bound for statistical compressio...
research
08/17/2020

Sublinear bounds for nullity of flows and approximating Tutte's flow conjectures

A function f:N→ N is sublinear, if lim_x→ +∞f(x)/x=0. If A is ...
research
04/30/2020

A class of examples demonstrating that P is different from NP in the "P vs NP" problem

The CMI Millennium "P vs NP Problem" can be resolved e.g. if one shows a...
research
12/04/2017

(Gap/S)ETH Hardness of SVP

We prove the following quantitative hardness results for the Shortest ...
research
10/21/2022

Complexity and Ramsey Largeness of Sets of Oracles Separating Complexity Classes

We prove two sets of results concerning computational complexity classes...
research
12/14/2021

Spatiogram: A phase based directional angular measure and perceptual weighting for ensemble source width

In concert hall studies, inter-aural cross-correlation (IACC), which is ...

Please sign up or login with your details

Forgot password? Click here to reset