UID:
almahu_9949218785202882
Format:
1 online resource (xi, 209 p. : ill.)
Edition:
Electronic reproduction. Providence, Rhode Island : American Mathematical Society. 2012
ISBN:
9781470439712 (online)
Series Statement:
DIMACS Series in Discrete Mathematics and Theoretical Computer Science, v. 13
Note:
Approximate counting with uniform constant depth circuits
,
On strong separations from $AC^0$
,
Parallel matching complexity of Ramsey's theorem
,
On algorithms for simple stochastic games
,
Locally random reductions in interactive complexity theory
,
An application of game theoretic techniques to cryptography
,
Composition of the universal relation
,
Practical perfect cryptographic security
,
Fair games against an all-powerful adversary
,
Factoring integers and computing discrete logarithms via diophantine approximation
,
A new lower bound theorem for read only once branching programs and its applications
,
On the E-isomorphism problem
,
Mode of access : World Wide Web
Additional Edition:
Print version: Advances in computational complexity theory / ISSN 1052-1798 ISBN 9780821865972
Language:
English
Bookmarklink
