First Page | Document Content | |
---|---|---|
Date: 2011-12-13 09:31:41Computational complexity theory Complexity classes Analysis of algorithms Mathematical optimization Structural complexity theory P versus NP problem NP Average-case complexity Computational complexity Reduction Randomized algorithm BPP | A Personal View of Average-Case Complexity Russell Impagliazzo Computer Science and Engineering UC, San Diego 9500 Gilman Drive La Jolla, CAAdd to Reading ListSource URL: www.karlin.mff.cuni.czDownload Document from Source WebsiteFile Size: 193,57 KBShare Document on Facebook |
Probabilistic Modeling and Model Checking Erika Ábrahám RWTH Aachen University, Germany SFM’14 Tutorial June 17, 2014DocID: 1rrqu - View Document | |
Spheres of Influence for More Effective Viral Marketing Yasir Mehmood Francesco Bonchi David García-SorianoDocID: 1riqm - View Document | |
Competitive Online Algorithms Susanne Albers Overview arrive one by one and must be scheduled immediatelyDocID: 1ri9G - View Document | |
Computing the Width of a Point Set in 3-Spa e Thomas Herrmann Institute for Theoreti al Computer S ien e Institute for Operations Resear hDocID: 1rhdY - View Document | |
Master thesis ANALYSIS OF A SIMPLE METHOD TO APPROXIMATE THE EXPECTED STATE OF A MARKOV CHAIN ByDocID: 1rdMz - View Document |