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 |