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.CSL.2020.2
URN: urn:nbn:de:0030-drops-116455
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/11645/
Dawar, Anuj
Symmetric Computation (Invited Talk)
Abstract
We discuss a recent convergence of notions of symmetric computation arising in the theory of linear programming, in logic and in circuit complexity. This leads us to a coherent and robust definition of problems that are efficiently and symmetrically solvable. This is at once a rich class of problems and one for which we have methods for proving lower bounds. In this paper, we take a tour through results which show applications of these methods in a number of areas.
BibTeX - Entry
@InProceedings{dawar:LIPIcs:2020:11645,
author = {Anuj Dawar},
title = {{Symmetric Computation (Invited Talk)}},
booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)},
pages = {2:1--2:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-132-0},
ISSN = {1868-8969},
year = {2020},
volume = {152},
editor = {Maribel Fern{\'a}ndez and Anca Muscholl},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/11645},
URN = {urn:nbn:de:0030-drops-116455},
doi = {10.4230/LIPIcs.CSL.2020.2},
annote = {Keywords: Descriptive Complexity, Fixed-point Logic with Counting, Circuit Complexity, Linear Programming, Hardness of Approximation, Arithmetic Circuits}
}
|
Keywords: |
|
Descriptive Complexity, Fixed-point Logic with Counting, Circuit Complexity, Linear Programming, Hardness of Approximation, Arithmetic Circuits |
|
Collection: |
|
28th EACSL Annual Conference on Computer Science Logic (CSL 2020) |
|
Issue Date: |
|
2020 |
|
Date of publication: |
|
06.01.2020 |
