Complexity - PDFSEARCH.IO - Document Search Engine

Complexity
Results: 8084

#	Item
601	Abstract Massive Data Streams in Graph Theory and Computational Geometry Jian Zhang 2005 Streaming is an important paradigm for handling data sets that are too large to ﬁt in main memory. In the streaming computational Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2005-07-14 17:36:00 Computing Computer architecture Concurrent computing Computational complexity theory Algorithm Computational geometry Distributed computing Graph theory Memory hierarchy Academia Streaming algorithm Theoretical computer science
602	The complexity of the current gap between the outcomes of Education and Training in Bahrain has been increasing despite the efforts taken by public and private entities. The changing employability skills and requirements Add to Reading List Source URL: www.mlsd.gov.bh Language: English - Date: 2015-11-11 05:25:50 Employability Employment Labour economics Ministry of Human Resources
603	CS264: Beyond Worst-Case Analysis The Top 10 List∗ Tim Roughgarden† December 3, 2014 We covered a lot of concepts in this course. To appreciate this, let’s review the overarching narrative of the course via a top 1 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-12-24 18:09:21 Computational complexity theory Theory of computation Mathematics Analysis of algorithms Operations research Mathematical optimization NP-complete problems Smoothed analysis Algorithm Competitive analysis Best worst and average case Time complexity
604	Nonlinearity in Complexity Science R.S.MacKay Mathematics Institute and Centre for Complexity Science University of Warwick, Coventry CV4 7AL, U.K. August 25, 2008 Add to Reading List Source URL: www2.warwick.ac.uk Language: English - Date: 1970-01-01 18:00:00 Metaphysics Complex systems theory Philosophy Systems science Systems Dynamical systems Cybernetics Complex system Complexity Chaos theory Quantum mechanics Nonlinear system
605	Generalized Matrix Factorizations as a Unifying Framework for Pattern Set Mining: Complexity Beyond Blocks Pauli Miettinen Max-Planck-Institut f¨ ur Informatik Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2015-06-15 11:21:37 Algebra Linear algebra Mathematics Matrices Matrix theory Sparse matrices Matrix Numerical linear algebra Rank Logical matrix Identity matrix Square matrix
606	doi:Communication Costs of Strassen’s Matrix Multiplication By Grey Ballard, James Demmel, Olga Holtz, and Oded Schwartz Add to Reading List Source URL: www.cs.huji.ac.il Language: English - Date: 2014-11-26 08:30:47 Mathematics Algebra Linear algebra Numerical linear algebra Multiplication Analysis of algorithms Matrix theory Matrix multiplication algorithm Computational complexity theory Matrix multiplication Algorithm Matrix
607	Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis May 19, Spring 2011 Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-05-20 09:43:49 Computational complexity theory Mathematics Theory of computation Analysis of algorithms Operations research Asymptotic analysis Combinatorial optimization Dynamic programming Master theorem Big O notation Knapsack problem Time complexity
608	Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Anupam Gupta∗ Amit Kumar† Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2004-09-21 15:30:39 Graph theory Mathematics Computational complexity theory NP-complete problems Steiner tree problem XTR Shortest path problem Flow network Maximum flow problem Graph coloring
609	Public Key Cryptography Public Key Cryptography • Symmetric Key: – Same key used for encryption and decrypiton – Same key used for message integrity and validation Add to Reading List Source URL: bioinfo.ict.ac.cn Language: English - Date: 2014-11-28 11:05:21 Cryptography Computational complexity theory Knapsack problem Cipher Public-key cryptography Encryption Symmetric-key algorithm Key P versus NP problem MerkleHellman knapsack cryptosystem RSA
610	A DESCRIPTIVE TITLE, NOT TOO GENERAL, NOT TOO LONG Markus P¨uschel Department of Computer Science ETH Z¨urich Z¨urich, Switzerland The hard page limit is 6 pages in this style. Do not reduce font size or use other tri Add to Reading List Source URL: spcl.inf.ethz.ch Language: English - Date: 2013-09-09 04:58:26 Sorting algorithms Computing Data processing Mathematics Algorithm Mathematical logic Theoretical computer science Sorting Sort Computational complexity theory Program optimization Selection algorithm

UPDATE