Abstract
The editors of this LNCS volume asked me to speculate on open problems: out of the prominent conjectures in computational complexity, which of them might be true, and why? I hope the reader is entertained.
Cite
CITATION STYLE
APA
Williams, R. R. (2019). Some estimated likelihoods for computational complexity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10000, pp. 9–26). Springer. https://doi.org/10.1007/978-3-319-91908-9_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free