Randomness and completeness in computational complexity

From MaRDI portal

Publication:1591868

Jump to:navigation, search

zbMath0980.68052MaRDI QIDQ1591868

Dieter van Melkebeek

Publication date: 10 January 2001

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

computational complexity random sets derandomization complexity classes pseudorandomness resource-bounded measure bounded reducibilities hardness versus randomness trade-offs resource-bounded betting games resource-bounded betting strategies

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (1)

TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications

This page was built for publication: Randomness and completeness in computational complexity

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1591868&oldid=13886940"