Nondeterministic Separations

  • Lance FortnowEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9076)


We survey recent research on the power of nondeterministic computation and how to use nondeterminism to get new separations of complexity classes. Results include separating \(\mathsf{NEXP}\) from \(\mathsf{NP}\) with limited advice, a new proof of the nondeterministic time hierarchy and a surprising relativized world where \(\mathsf{NP}\) is as powerful as \(\mathsf{NEXP}\) infinitely often.


  1. 1.
    Buhrman, H., Fortnow, L., Santhanam, R.: Unconditional lower bounds against advice. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 195–209. Springer, Heidelberg (2009) CrossRefGoogle Scholar
  2. 2.
    Fortnow, L., Santhanam, R.: Robust simulations and significant separations. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol. 6755, pp. 569–580. Springer, Heidelberg (2011) CrossRefGoogle Scholar
  3. 3.
    Fortnow, L., Santhanam, R.: Hierarchies against sublinear advice. Technical report TR14-171, Electronic Colloquium on Computational Complexity (2014)Google Scholar
  4. 4.
    Cook, S.: A hierarchy for nondeterministic time complexity. J. Comput. Syst. Sci. 7(4), 343–353 (1973)CrossRefzbMATHGoogle Scholar
  5. 5.
    Seiferas, J., Fischer, M., Meyer, A.: Separating nondeterministic time complexity classes. J. ACM 25(1), 146–167 (1978)CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Žàk, S.: A turing machine time hierarchy. Theor. Comput. Sci. 26(3), 327–333 (1983)CrossRefzbMATHGoogle Scholar
  7. 7.
    Kannan, R.: Circuit-size lower bounds and non-reducibility to sparse sets. Inf. Control 55, 40–56 (1982)CrossRefzbMATHGoogle Scholar
  8. 8.
    Homer, S., Mocas, S.: Nonuniform lower bounds for exponential time classes. In: Hájek, Petr, Wiedermann, Jiří (eds.) MFCS 1995. LNCS, vol. 969. Springer, Heidelberg (1995) CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Georgia Institute of TechnologyAtlantaUSA

Personalised recommendations