Resource-bounded measure on probabilistic classes

Authors:
Philippe Moser
Affiliations:
Department of Computer Science, National University of Ireland, Maynooth Co. Kildare, Ireland
Venue:
Information Processing Letters
Year:
2008

Citing 8
Cited 2

Category and measure in complexity classes

SIAM Journal on Computing
Almost everywhere high nonuniform complexity

Journal of Computer and System Sciences
Natural proofs

Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Measure on P: strength of the notion

Information and Computation
The quantitative structure of exponential time

Complexity theory retrospective II
Probabilistic Martingales and BPTIME Classes

COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
Baire categories on small complexity classes and meager--comeager laws

Information and Computation
Martingale families and dimension in p

CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers

Martingale families and dimension in P

Theoretical Computer Science
Axiomatizing resource bounds for measure

CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe

Quantified Score

Hi-index	0.89

Visualization

Abstract

We extend Lutz's resource-bounded measure to probabilistic classes, and obtain notions of resource-bounded measure on probabilistic complexity classes such as BPE and BPEXP. Unlike former attempts, our resource bounded measure notions satisfy all three basic measure properties, that is every singleton {L} has measure zero, the whole space has measure one, and ''enumerable infinite unions'' of measure zero sets have measure zero.