Complexity - PDFSEARCH.IO - Document Search Engine

Complexity
Results: 8084

#	Item
581	Truthful Approximation Schemes for Single-Parameter Agents∗ Peerapong Dhangwatnotai† Shahar Dobzinski‡ Shaddin Dughmi§ Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2011-05-11 07:37:06 Computational complexity theory Mathematics Theory of computation Analysis of algorithms Scheduling Polynomial-time approximation scheme Makespan Time complexity Partition Randomized algorithm Algorithm Integral
582	Generating tractable CSPs by means of adjoint functors Jan Foniok joint work with Claude Tardif Fête of Combinatorics and Computer Science Add to Reading List Source URL: www.ifor.math.ethz.ch Language: English - Date: 2008-11-18 08:48:31 Graph theory Mathematics Constraint programming Discrete mathematics Morphisms Constraint satisfaction problem Graph homomorphism Constraint satisfaction Complexity of constraint satisfaction Graph minor
583	Scalable Flow-Based Community Detection for Large-Scale Network Analysis Seung-Hee Bae∗ , Daniel Halperin∗ , Jevin West† , Martin Rosvall‡ and Bill Howe∗ ∗ Department of Computer Science and Engineering, Uni Add to Reading List Source URL: www.jevinwest.org Language: English - Date: 2015-11-11 00:05:03 Mathematics Computational complexity theory NP-complete problems Algorithm Mathematical logic Theoretical computer science Graph partition Community structure Connectivity
584	This is Floodline. Warning for d o lo F Add to Reading List Source URL: www.floodlinescotland.org.uk Language: English - Date: 2015-10-14 07:09:25 Complexity classes Finite model theory FO CK
585	Lossless Condensers, Unbalanced Expanders, and Extractors Amnon Ta-Shma∗ Christopher Umans† David Zuckerman‡ Add to Reading List Source URL: users.cms.caltech.edu Language: English - Date: 2007-05-07 14:18:08 Cryptography Theoretical computer science Pseudorandomness Randomness Applied mathematics Information theory Computational complexity theory Random number generation Extractor Entropy Disperser Pseudorandom generator
586	Microsoft Word - MS-wccm12 Add to Reading List Source URL: www.cs.utep.edu Language: English - Date: 2015-10-30 22:10:53 Statistics Academia Applied mathematics Measurement Monte Carlo method Numerical analysis Probabilistic complexity theory Uncertainty Structural analysis
587	The Complexity of the k-means Method∗ Tim Roughgarden1 and Joshua R. Wang2 1 Department of Computer Science, Stanford Univeresity, 474 Gates Building, 353 Serra Mall, Stanford, CA 94305, USA Add to Reading List Source URL: web.stanford.edu Language: English - Date: 2016-08-08 16:24:20 Statistics NAND gate FO Mathematics K-means clustering K-means++ Gadget Cluster analysis Applied mathematics
588	MANAGING COMPLEXITY Julia Culen I Christian Mayhofer Barcelona, Oct 3 2014 COM Add to Reading List Source URL: www.cmpartner.at - Date: 2014-10-08 04:34:06
589	LNCSA Universally Composable Mix-Net Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2012-05-30 08:39:36 Cryptography Public-key cryptography Computational complexity theory Proof of knowledge Zero-knowledge proof IP Raspberry Pi
590	An Eﬃcient Parallel Repetition Theorem Johan H˚ astad1 , Rafael Pass2, Douglas Wikstr¨ om3 , and Krzysztof Pietrzak4 1 KTH, Stockholm, supported by ERC grant Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2012-05-30 08:53:38 Computational complexity theory Cryptography Theory of computation Probabilistic complexity theory IP Zero-knowledge proof Soundness PP Entropy NP Randomized algorithm Interactive proof system

UPDATE