Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Measure on Small Complexity Classes, with Applications for BPP Eric Allender
 

Summary: Measure on Small Complexity Classes, with Applications for BPP
Eric Allender
Department of Computer Science
Rutgers University
New Brunswick, NJ 08903
allender@cs.rutgers.edu
Martin Strauss
Department of Mathematics
Rutgers University
New Brunswick, NJ 08903
mstrauss@math.rutgers.edu
Abstract
We present a notion of resource-bounded mea-
sure for P and other subexponential-time classes.
This generalization is based on Lutz's notion of
measure, but overcomes the limitations that cause
Lutz's de nitions to apply only to classes at least
as large as E. We present many of the basic prop-
erties of this measure, and use it to explore the
class of sets that are hard for BPP.

  

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

 

Collections: Computer Technologies and Information Sciences