First Page | Document Content | |
---|---|---|
Date: 2003-12-08 11:12:51Computational complexity theory Theory of computation Mathematics Complexity classes Computational problems Theoretical computer science Structural complexity theory Tutte polynomial NP Quantum computing Time complexity Reduction | The Complexity of Counting and Randomised Approximation Magnus Bordewich New College University of OxfordAdd to Reading ListSource URL: community.dur.ac.ukDownload Document from Source WebsiteFile Size: 693,96 KBShare 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 |