2000 character limit reached
Consequences of APSP, triangle detection, and 3SUM hardness for separation between determinism and non-determinism
Published 4 Nov 2020 in cs.CC | (2011.02428v5)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.