Asymptotic computational complexity - PDFSEARCH.IO - Document Search Engine

Asymptotic computational complexity
Results: 28

#	Item
21	Experimental Supplements to the Computational Complexity Analysis of Genetic Programming for Problems Modelling Isolated Program Semantics Tommaso Urli1 , Markus Wagner2 , and Frank Neumann2 1 Add to Reading List Source URL: tunnuz.net Language: English - Date: 2014-09-12 00:58:22 Applied mathematics Mathematics Operations research Asymptotic analysis Mathematical optimization Big O notation Theoretical computer science Computational complexity theory Analysis of algorithms
22	Lower Bounds for the Noisy Broadcast Problem Navin Goyal ∗ [removed] Dept. of Computer Science Rutgers University Add to Reading List Source URL: dimacs.rutgers.edu Language: English - Date: 2006-03-28 19:38:19 Computational complexity theory Communication Models of computation Asymptotic analysis Quantum information science Michael Saks Information theory Decision tree model Big O notation Theoretical computer science Applied mathematics Mathematics
23	Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine and Srini Devadas September 15, 2011 Problem Set 2 Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-09-25 21:36:41 Computer science Programming idioms Computational complexity theory Asymptotic analysis Recursion Theory of computation Rendering Big O notation Time complexity Theoretical computer science Analysis of algorithms Mathematics
24	6.851: Advanced Data Structures Spring 2012 Lecture 13 — April 5, 2012 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2012-05-29 13:10:42 Communication Computational complexity theory Analysis of algorithms Asymptotic analysis Big O notation Mathematical notation Information theory Communication complexity Combinatory logic Theoretical computer science Applied mathematics Mathematics
25	c 2014 Society for Industrial and Applied Mathematics SIAM J. DISCRETE MATH. Vol. 28, No. 1, pp. 342–371 Add to Reading List Source URL: 140.109.74.92 Language: English - Date: 2014-03-12 09:54:52 Computational complexity theory Asymptotic analysis Big O notation Mathematical notation Symbol Exponentiation Time complexity Analysis of algorithms Mathematics Applied mathematics
26	On Asymptotic Notation with Multiple Variables Rodney R. Howell Dept. of Computing and Information Sciences Kansas State University Manhattan, KS[removed]USA Add to Reading List Source URL: people.cis.ksu.edu Language: English - Date: 2008-01-18 11:45:18 Integer sequences Number theory Computational complexity theory Big O notation N1 Factorial Function Summation Analysis of algorithms Mathematics Mathematical notation Combinatorics
27	Order Notation in Practice Roger Orr OR/2 Limited What does complexity measurement mean? Add to Reading List Source URL: accu.org Language: English - Date: 2014-04-14 04:21:09 Analysis of algorithms Mathematical notation Asymptotic analysis Big O notation Structural complexity theory Blum axioms Logarithm HO Function Theoretical computer science Mathematics Computational complexity theory
28	An Introduction to Mathematical Methods in Combinatorics Renzo Sprugnoli Add to Reading List Source URL: www.dsi.unifi.it Language: English - Date: 2009-12-17 03:41:51 Analysis of algorithms Number theory Computational complexity theory Integer sequences Asymptotic analysis Big O notation Time complexity Euler–Mascheroni constant Euclidean algorithm Mathematics Theoretical computer science Mathematical analysis

UPDATE