Relative to a random oracle, P/poly is not measurable in EXP

DOI10.1016/S0020-0190(98)00197-5zbMath1339.68102OpenAlexW2068307266MaRDI QIDQ294619

Marius Zimand

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001975?np=y

zbMATH Keywords

computational complexityEXPP/polypseudo-random generatorresource-bounded measure

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relativized circuit complexity
• Almost everywhere high nonuniform complexity
• Circuit size relative to pseudorandom oracles
• On the size of classes with weak membership properties
• On collapsing the polynomial-time hierarchy
• Relativized worlds with an infinite hierarchy
• Process complexity and effective random tests

This page was built for publication: Relative to a random oracle, P/poly is not measurable in EXP