Skip to main content
Conference Proceedings

Towards NEXP versus BPP

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) 7913 LNCS 174-182
DOI: 10.1007/978-3-642-38536-0_15
2Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We outline two plausible approaches to improving the miserable state of affairs regarding lower bounds against probabilistic polynomial time (namely, the class BPP). © 2013 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Williams, R. (2013). Towards NEXP versus BPP. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7913 LNCS, pp. 174–182). Springer Verlag. https://doi.org/10.1007/978-3-642-38536-0_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free