First Page | Document Content | |
---|---|---|
Date: 2018-08-09 16:19:58Cryptography Mathematics Theoretical computer science Computational complexity theory Secret sharing Quantum complexity theory Secure multi-party computation IP PP Polynomial Communication complexity Lagrange polynomial | Best of Both Worlds in Secure Computation, with Low Communication OverheadAdd to Reading ListSource URL: web.eecs.umich.eduDownload Document from Source WebsiteFile Size: 1,86 MBShare Document on Facebook |
Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of viewDocID: 1xVR3 - View Document | |
Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗DocID: 1xUAX - View Document | |
Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcsDocID: 1xUr4 - View Document | |
Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingenDocID: 1xTuz - View Document | |
CS 153 Current Topics in Theoretical Computer Science Spring 2016DocID: 1vryF - View Document |