First Page | Document Content | |
---|---|---|
Date: 2013-08-01 05:50:27Complexity classes P-complete NC Parameterized complexity P FO L Reachability Time complexity Theoretical computer science Computational complexity theory Applied mathematics | Making Queries Tractable on Big Data with Preprocessing (through the eyes of complexity theory) Wenfei Fan Floris GeertsAdd to Reading ListSource URL: www.vldb.orgDownload Document from Source WebsiteFile Size: 886,20 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 |