First Page | Document Content | |
---|---|---|
Date: 2016-01-03 06:45:47Analysis of algorithms Worst-case complexity Parameterized complexity P versus NP problem | Parameterized Average-Case Complexity of the Hypervolume Indicator Karl Bringmann Tobias FriedrichAdd to Reading ListSource URL: people.mpi-inf.mpg.deDownload Document from Source WebsiteFile Size: 273,70 KBShare Document on Facebook |
Representative Families and Kernels Fahad Panolan Department of Informatics, University of Bergen, Norway Parameterized Complexity Summer SchoolDocID: 1vk0H - View Document | |
Some open problems in parameterized complexity Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI) Budapest, HungaryDocID: 1v7gN - View Document | |
Lower bounds for polynomial kernelization Michal Pilipczuk Institute of Informatics, University of Warsaw, Poland Parameterized Complexity Summer SchoolDocID: 1uKug - View Document | |
Discrete Applied Mathematics – 429 www.elsevier.com/locate/dam Parameterized complexity of vertex colouring Leizhen Cai ∗DocID: 1uqiK - View Document | |
Parameterized complexity of even/odd subgraph problemsDocID: 1up1m - View Document |