Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Almost-Everywhere Complexity Hierarchies for Nondeterministic Time
 

Summary: Almost-Everywhere Complexity Hierarchies for
Nondeterministic Time
Eric Allendery
Department of Computer Science, Rutgers University
New Brunswick, NJ, USA 08903
Richard Beigelz
Department of Computer Science, Yale University
51 Prospect St.
P. O. Box 2158, Yale Station
New Haven, CT, USA 06520-2158
Ulrich Hertrampf
Institut fur Informatik, Universitat Wurzburg
D-8700 Wurzburg, Federal Republic of Germany
Steven Homerx
Department of Computer Science, Boston University
Boston, MA, USA 02215
A preliminary version of this work appeared as 2 .
ySupported in part by National Science Foundation grant CCR-9000045. Some of this research was
performed while the author was a visiting professor at Institut fur Informatik, Universitat Wurzburg,
D-8700 Wurzburg, Federal Republic of Germany.

  

Source: Allender, Eric - Department of Computer Science, Rutgers University

 

Collections: Computer Technologies and Information Sciences