PowerPoint template for scientific poster

First Page		Document Content
Date: 2011-03-15 15:13:11 Genetic algorithms Abstract algebra Combinatorics Permutation Time complexity Mutation Computational complexity theory Algorithm NP-hard Theoretical computer science Applied mathematics Mathematics		PowerPoint template for scientific poster Add to Reading List Source URL: skelk.sdf-eu.org Download Document from Source Website File Size: 64,69 KB Share Document on Facebook

	Fixed-Priority Schedulability of Sporadic Tasks on Uniprocessors is NP-hard Pontus Ekberg and Wang Yi Uppsala University, Sweden Email: {pontus.ekberg \| yi}@it.uu.se DocID: 1vha8 - View Document
	New Set of Codes for the Maximum-Likelihood Decoding Problem M. Barbier Abstract The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduc DocID: 1uWxx - View Document
	Deterministic Sampling Algorithms for Network Design Anke van Zuylen Abstract For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample DocID: 1sT6n - View Document
	Polynomial-time special cases of NP-hard problems DocID: 1sIPR - View Document
	Minimum Bisection is NP-hard on Unit Disk Graphs Josep D´ıaz1 and George B. Mertzios2∗ 1 2 DocID: 1rWLo - View Document