The following publications are possibly variants of this publication:
- Beyond P^(NP) - NEXPStephen A. Fenner, Lance Fortnow. STACS 1995: 619-627
- Complexity classes of equivalence problems revisitedLance Fortnow, Joshua A. Grochow. iandc, 209(4):748-763, 2011. [doi]
- Guest Editor s ForewordLance Fortnow. jcss, 62(2):215, 2001.
- Time-Space Tradeoffs for SatisfiabilityLance Fortnow. jcss, 60(2):337-353, 2000.
- My Favorite Ten Complexity Theorems of the Past DecadeLance Fortnow. fsttcs 1994: 256-275
- DiagonalizationLance Fortnow. eatcs, 71:102-113, 2000.
- The Role of Relativization in Complexity TheoryLance Fortnow. eatcs, 52:229-243, 1994.
- One complexity theorist s view of quantum computingLance Fortnow. TCS, 31:58-72, 2000. [doi]
- Review of Theory of semi-feasible algorithms by Lane Hemaspaandra and Leen Torenvliet. SpringerLance Fortnow. sigact, 35(2):16-18, 2004. [doi]
- Comparing Notions of Full DerandomizationLance Fortnow. cocoon 2001: 28-34 [doi]
- The History of ComplexityLance Fortnow. cocoon 2002: 61 [doi]
- Nondeterministic Polynomial Time versus Nondeterministic Logarithmic Space: Time-Space Tradeoffs for SatisfiabilityLance Fortnow. cocoon 1997: 52-60 [doi]
- DiagonalizationLance Fortnow. In Current Trends in Theoretical Computer Science. pages 102-114, 2001.
- One complexity theorist s view of quantum computingLance Fortnow. TCS, 292(3):597-610, 2003.