Philippe Moser Relative to P, APP and promise-BPP are the same [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:068, pp:- [Journal]
Philippe Moser Random nondeterministic real functions and Arthur Merlin games [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:006, pp:- [Journal]
Philippe Moser ZPP is hard unless RP is small [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:015, pp:- [Journal]
Philippe Moser A generalization of Lutz's measure to probabilistic classes [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:058, pp:- [Journal]
Philippe Moser BPP has effective dimension at most 1/2 unless BPP=EXP [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:029, pp:- [Journal]
Philippe Moser RP is Small in SUBEXP else ZPP equals PSPACE and NP equals EXP [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:040, pp:- [Journal]
Philippe Moser Locally Computed Baire's Categories on Small Complexity Classes [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:046, pp:- [Journal]
Philippe Moser Martingale Families and Dimension in P [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:045, pp:- [Journal]
Philippe Moser Generic Density and Small Span Theorem [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:060, pp:- [Journal]