zweidimensionales bewegtes Bild
Successor-Invariant First-Order Logic on Classes of Bounded Degree: Q/A Session D - Paper D5.C
- Standort
-
Hannover TIB
- Umfang
-
28MB, 00:16:01:08 (unknown)
- Sprache
-
Englisch
- Anmerkungen
-
Audiovisuelles Material
- Erschienen in
-
Thirty-Fifth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2020 ; (Jan. 2020)
- Ereignis
-
Veröffentlichung
- (wer)
-
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
- (wann)
-
2020-01-01
- Beteiligte Personen und Organisationen
-
Grange, Julien
- DOI
-
10.5446/49300
- Letzte Aktualisierung
-
04.12.2024, 08:09 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Technische Informationsbibliothek (TIB). Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Technische Informationsbibliothek (TIB). Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- zweidimensionales bewegtes Bild
Beteiligte
- Grange, Julien
- Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
Entstanden
- 2020-01-01
Ähnliche Objekte (12)
On The Relational Width of First-Order Expansions of Finitely Bounded Homogeneous Binary Cores with Bounded Strict Width: Q/A Session F - Paper F5.D
First-order fragments with successor over infinite words
On Invariant Formulae of First-Order Logic with Numerical Predicates
First-order tree-to-tree functions: Q/A Session C - Paper C5.E
The parameterized space complexity of model-checking bounded variable first-order logic
Counting Bounded Tree Depth Homomorphisms: Q/A Session D - Paper D5.A
![Qa- [Qa-]](https://iiif.deutsche-digitale-bibliothek.de/image/2/ad9b8567-c447-46da-a7ba-53b4975e74ba/full/!306,450/0/default.jpg)
Qa- [Qa-]
On the locality of arb-invariant first-order formulas with modulo counting quantifiers
Spectral Sparsification via Bounded-Independence Sampling: Q/A Session D - Paper D3.B
Two new perspectives on algorithmic meta-theorems : evaluating approximate first-order counting queries on bounded expansion and first-order queries on random graphs
Lower Bounds for QBFs of Bounded Treewidth: Q/A Session D - Paper D5.B
On Decidability of Time-bounded Reachability in CTMDPs: Q/A Session A - Paper A4.D
On The Relational Width of First-Order Expansions of Finitely Bounded Homogeneous Binary Cores with Bounded Strict Width: Q/A Session F - Paper F5.D
First-order fragments with successor over infinite words
On Invariant Formulae of First-Order Logic with Numerical Predicates
First-order tree-to-tree functions: Q/A Session C - Paper C5.E
The parameterized space complexity of model-checking bounded variable first-order logic
Counting Bounded Tree Depth Homomorphisms: Q/A Session D - Paper D5.A
Qa- [Qa-]
On the locality of arb-invariant first-order formulas with modulo counting quantifiers
Spectral Sparsification via Bounded-Independence Sampling: Q/A Session D - Paper D3.B
Two new perspectives on algorithmic meta-theorems : evaluating approximate first-order counting queries on bounded expansion and first-order queries on random graphs
Lower Bounds for QBFs of Bounded Treewidth: Q/A Session D - Paper D5.B
On Decidability of Time-bounded Reachability in CTMDPs: Q/A Session A - Paper A4.D
On The Relational Width of First-Order Expansions of Finitely Bounded Homogeneous Binary Cores with Bounded Strict Width: Q/A Session F - Paper F5.D
First-order fragments with successor over infinite words
On Invariant Formulae of First-Order Logic with Numerical Predicates
First-order tree-to-tree functions: Q/A Session C - Paper C5.E
The parameterized space complexity of model-checking bounded variable first-order logic
Counting Bounded Tree Depth Homomorphisms: Q/A Session D - Paper D5.A
Qa- [Qa-]
On the locality of arb-invariant first-order formulas with modulo counting quantifiers
Spectral Sparsification via Bounded-Independence Sampling: Q/A Session D - Paper D3.B
Two new perspectives on algorithmic meta-theorems : evaluating approximate first-order counting queries on bounded expansion and first-order queries on random graphs
Lower Bounds for QBFs of Bounded Treewidth: Q/A Session D - Paper D5.B