2000 character limit reached
Inseparability and Strong Hypotheses for Disjoint NP Pairs (0902.2674v4)
Published 16 Feb 2009 in cs.CC
Abstract: This paper investigates the existence of inseparable disjoint pairs of NP languages and related strong hypotheses in computational complexity. Our main theorem says that, if NP does not have measure 0 in EXP, then there exist disjoint pairs of NP languages that are P-inseparable, in fact TIME(2nk)-inseparable. We also relate these conditions to strong hypotheses concerning randomness and genericity of disjoint pairs.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.