License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2016.27
URN: urn:nbn:de:0030-drops-64423
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6442/
Chen, Yijia ;
Flum, Jörg
Some Lower Bounds in Parameterized AC^0
Abstract
We demonstrate some lower bounds for parameterized problems via parameterized classes corresponding to the classical AC^0. Among others, we derive such a lower bound for all fpt-approximations of the parameterized clique problem and for a parameterized halting problem, which recently turned out to link problems of computational complexity, descriptive complexity, and proof theory. To show the first lower bound, we prove a strong AC^0 version of the planted clique conjecture: AC^0-circuits asymptotically almost surely can not distinguish between a random graph and this graph with a randomly planted clique of any size <= n^xi (where 0 <= xi < 1).
BibTeX - Entry
@InProceedings{chen_et_al:LIPIcs:2016:6442,
author = {Yijia Chen and J{\"o}rg Flum},
title = {{Some Lower Bounds in Parameterized AC^0}},
booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)},
pages = {27:1--27:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-016-3},
ISSN = {1868-8969},
year = {2016},
volume = {58},
editor = {Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6442},
URN = {urn:nbn:de:0030-drops-64423},
doi = {10.4230/LIPIcs.MFCS.2016.27},
annote = {Keywords: parameterized AC^0, lower bound, clique, halting problem}
}
|
Keywords: |
|
parameterized AC^0, lower bound, clique, halting problem |
|
Collection: |
|
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) |
|
Issue Date: |
|
2016 |
|
Date of publication: |
|
19.08.2016 |
