Chain minors are FPT Jaroslaw Blasiok1 and Marcin Kami´ nski2 1 Instytut Informatyki

First Page		Document Content
Computational complexity theory Theory of computation Analysis of algorithms Order theory Parameterized complexity NP Exponential time hypothesis Randomized algorithm Time complexity Partially ordered set Order dimension		Chain minors are FPT Jaroslaw Blasiok1 and Marcin Kami´ nski2 1 Instytut Informatyki Add to Reading List Source URL: rutcor.rutgers.edu Download Document from Source Website File Size: 324,06 KB Share Document on Facebook

	The Generalized Median Stable Matchings: finding them is not that easy Christine T. Cheng Department of Computer Science University of Wisconsin–Milwaukee, Milwaukee, WI 53211, USA. DocID: 1roij - View Document
	Pseudo Boolean Programming for Partially Ordered Genomes Sébastien Angibaud1 , Guillaume Fertin1 , Annelyse Thévenin2 and Stéphane Vialette3 1 DocID: 1r0hn - View Document
	143 Documenta Math. Homology Stability for Unitary Groups B. Mirzaii, W. van der Kallen DocID: 1qZiO - View Document
	Lexicographic Composition of Fuzzy Orderings Ulrich Bodenhofer Software Competence Center Hagenberg A-4232 Hagenberg, Austria DocID: 1qMxj - View Document
	Computing minimal mappings between Lightweight Ontologies DocID: 1qEN8 - View Document