guest ::
Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic
;
In
Proceedings of the 31st Annual ACMIEEE Symposium on Logic in Computer Science / Grohe, MartinProceedings of the 31st Annual ACM-IEEE Symposium on Logic in Computer Science (LICS 2016) : July 5-8, 2016 New York City, USA / LICS General Chair: Martin Grohe; LICS Conference Chair: Eric Koskinen; LICS Program Chair: Natarajan Shankar, Seiten/Artikel-Nr: 287-296
2016
Online
DOI: 10.1145/2933575.2933595
Einrichtungen
- Lehrstuhl für Informatik 7 (Logik und Theorie diskreter Systeme) (122910)
- Fachgruppe Informatik (120000)
- Juniorprofessur für Komplexität diskreter Probleme (122930)
Dokumenttyp
Contribution to a book/Contribution to a conference proceedings
Format
online, print
Sprache
English
Anmerkung
Peer reviewed article
Externe Identnummern
WOS Core Collection: WOS:000387609200029
SCOPUS: SCOPUS:2-s2.0-84994637549
OpenAlex: W2964195552
Interne Identnummern
RWTH-2016-11366
Datensatz-ID: 679761
Beteiligte Länder
Germany
Related:
Proceedings/Book
Proceedings of the 31st Annual ACM-IEEE Symposium on Logic in Computer Science (LICS 2016) : July 5-8, 2016 New York City, USA / LICS General Chair: Martin Grohe; LICS Conference Chair: Eric Koskinen; LICS Program Chair: Natarajan Shankar
31. Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NYNew York, NY, USA, 5 Jul 2016 - 8 Jul 2016
New York, NY : ACM 1 Online-Ressource (901 Seiten) (2016) [10.1145/2933575]
BibTeX |
EndNote:
XML,
Text |
RIS
|
The record appears in these collections: |