First Page | Document Content | |
---|---|---|
![]() Date: 2014-04-12 05:40:19Lance Fortnow Probabilistic complexity theory BPP Probabilistically checkable proof Carsten Lund Computational complexity theory | Add to Reading List |
![]() | Method for High Accuracy Multiplicity Correlation Measurements Carsten Søgaard Lund University, SwedenDocID: 1uf8d - View Document |
![]() | Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing.DocID: 1rgOi - View Document |
![]() | Interactive proofs April 12, L´ aszl´ o Babai. Trading group theory for randomness. In Proc. 17th STOC, pages 421–429. ACM Press, 1985. doi:22192.DocID: 1oP1q - View Document |
![]() | FlowRoute: Inferring Forwarding Table Updates Using Passive Flow-level Measurements Amogh Dhamdhere Lee Breslau, Nick Duffield, Cheng Ee, Alexandre Gerber, Carsten Lund,DocID: 1leQR - View Document |
![]() | Scalable VPN Routing via Relaying Changhoon Kim Alexandre Gerber Carsten LundDocID: 1lcn9 - View Document |