Hardness of Easy Problems: Basing Hardness onPopular Conjectures such as the StrongExponential Time Hypothesis – Papersᵞ

Warning: MathJax requires JavaScript to process the mathematics on this page.
If your browser supports JavaScript, be sure it is enabled.

☆

1

Hardness of Easy Problems: Basing Hardness onPopular Conjectures such as the StrongExponential Time Hypothesis

http://people.csail.mit.edu/virgi/ipec-survey.pdf

Authors: Virginia V. Williams
Liked by: Maximimi
Domains: Computational Complexity (cs.CC), Hardness in P
Tags: LiMass

Uploaded by: Maximimi
Upload date: 2020-12-31 12:57:33
Edited at: 2021-01-05 23:07:50
Edited by: Sergey Kirgizov

Comments: