On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Competing Provers Yield Improved Karp-Lipton Collapse Results
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Competing provers yield improved Karp-Lipton collapse results
Information and Computation
Open questions in the theory of semifeasible computation
ACM SIGACT News
Journal of Computer and System Sciences
Competing provers yield improved Karp-Lipton collapse results
Information and Computation
Finite groups and complexity theory: from leningrad to saint petersburg via las vegas
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Hi-index | 0.00 |