Complexity - PDFSEARCH.IO - Document Search Engine

Complexity
Results: 8084

#	Item
731	What makes the Arc-Preserving Subsequence problem hard?⋆ Guillaume Blin1 , Guillaume Fertin1 , Romeo Rizzi2 , and St´ephane Vialette3 1 2 Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2009-07-03 08:56:58 Computational complexity theory Complexity classes Theory of computation NP P Reduction Time complexity
732	May 19, Spring 2011 Final Exam Introduction to Algorithms Massachusetts Institute of Technology Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-05-20 09:47:26 Mathematics Computational complexity theory Mathematical analysis Analysis of algorithms Operations research Mathematical notation Asymptotic analysis Dynamic programming Big O notation Time complexity Recurrence relation Knapsack problem
733	Improved Parallel Integer Sorting without Concurrent Writing Susanne Albersyz Torben Hagerupy Add to Reading List Source URL: www14.in.tum.de Language: English - Date: 2013-11-25 11:07:42 Sorting algorithms Mathematics Order theory Theory of computation Radix sort Bitonic sorter Time complexity Merge sort Integer sorting Computational complexity theory Algorithm Big O notation
734	Instrumentational complexity of music genres and why simplicity sells Gamaliel Percino1 , Peter Klimek1 , Stefan Thurner1,2,3∗ arXiv:1405.5057v1 [physics.soc-ph] 20 May 2014 Add to Reading List Source URL: arxiv.org Language: English - Date: 2014-05-20 20:38:03 Music Entertainment Jazz genres Counterculture of the 1960s African-American music Popular music Jazz fusion Progressive rock Drum and bass Jazz Classical music Rock music
735	Early-Deciding Consensus is Expensive Danny Dolev Christoph Lenzen Hebrew University of Jerusalem Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2015-05-29 10:12:04 Computing Computational complexity theory Fault-tolerant computer systems Knowledge representation Consensus Distributed computing Tree Randomized algorithm Computer programming
736	The International Olympiad in Informatics Syllabus 1 Version and status information Add to Reading List Source URL: ioinformatics.org Language: English - Date: 2013-10-04 02:55:48 Computer programming Software engineering Mathematics Recursion Theoretical computer science Operations research Computability theory International Olympiad in Informatics International Science Olympiad Algorithm Sorting algorithm Computational complexity theory
737	Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann1 and Tobias Friedrich2 1 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:44:56 Computational complexity theory Theory of computation Complexity classes Approximation algorithms Computational hardness assumptions Polynomial-time approximation scheme Time complexity NC Reduction Exponential time hypothesis NP-hardness NP
738	The Complexity of Computing the Solution Obtained by a Specific Algorithm Paul W. Goldberg Department of Computer Science University of Oxford, U. K. Add to Reading List Source URL: www.maths.lse.ac.uk Language: English - Date: 2013-10-30 13:41:09 Computational complexity theory Complexity classes Theory of computation PPAD Reduction LemkeHowson algorithm Algorithm NP PSPACE-complete P True quantified Boolean formula
739	Popular articles April 12, L´ aszl´ o Babai. E-mail and the unexpected power of interaction. In Proc. 5th IEEE Conf. on Structure in Complexity Theory (SCT’90), pages 30–44. Add to Reading List Source URL: people.cs.uchicago.edu Language: English - Date: 2014-04-12 05:05:39 Babai Aga
740	Approximating the volume of unions and intersections of high-dimensional geometric objects Karl Bringmann1 and Tobias Friedrich2,3 1 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:44:42 Computational complexity theory Theory of computation Complexity classes Polynomial-time approximation scheme BPP Time complexity NP NC

UPDATE