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 InformatykiAdd to Reading ListSource URL: rutcor.rutgers.eduDownload Document from Source WebsiteFile Size: 324,06 KBShare Document on Facebook |
Probabilistic Modeling and Model Checking Erika Ábrahám RWTH Aachen University, Germany SFM’14 Tutorial June 17, 2014DocID: 1rrqu - View Document | |
Spheres of Influence for More Effective Viral Marketing Yasir Mehmood Francesco Bonchi David García-SorianoDocID: 1riqm - View Document | |
Competitive Online Algorithms Susanne Albers Overview arrive one by one and must be scheduled immediatelyDocID: 1ri9G - View Document | |
Computing the Width of a Point Set in 3-Spa e Thomas Herrmann Institute for Theoreti al Computer S ien e Institute for Operations Resear hDocID: 1rhdY - View Document | |
Master thesis ANALYSIS OF A SIMPLE METHOD TO APPROXIMATE THE EXPECTED STATE OF A MARKOV CHAIN ByDocID: 1rdMz - View Document |