commit e786a8abdeb8bfa71808f9eece6e01c32acc3386
parent f11843c8a02962fa2f776df6375afe9c1eeb938c
Author: Antoine Amarilli <a3nm@a3nm.net>
Date: Tue, 11 Nov 2025 08:45:02 +0100
reorder
Diffstat:
| publis | | | 33 | ++++++++++++++++++++++----------- |
1 file changed, 22 insertions(+), 11 deletions(-)
diff --git a/publis b/publis
@@ -1,22 +1,14 @@
Id: amarilli2025confluence
-Title: Confluence of the Node-Domination and Edge-Domination Hypergraph Rewrite Rules
+Title: Locality Testing for NFAs is PSPACE-complete
Authors: me mikael rdepretto
Status: draft
Reviewed: no
-Url: https://arxiv.org/abs/2510.09286
-Venue: arXiv:2510.09286v1
+Url: https://arxiv.org/abs/2511.07361
+Venue: arXiv:2511.07361v1
HideCv: yes
Type: note
Issue: 2025
-Id: amarilli2025complexity
-Title: On the Complexity of Language Membership for Probabilistic Words
-Authors: me mikael praphael ssalvati
-Url: https://arxiv.org/abs/2510.08127
-Status: submitted
-Data: words
-Query: PQE, CFG
-
Id: amarilli2025approximating
Title: Approximating Queries on Probabilistic Graphs
Authors: me tvanbremen ogaspard kmeel
@@ -30,6 +22,25 @@ DOI: none
Data: graphs
Query: PQE, combined, approximation
+Id: amarilli2025confluence
+Title: Confluence of the Node-Domination and Edge-Domination Hypergraph Rewrite Rules
+Authors: me mikael rdepretto
+Status: draft
+Reviewed: no
+Url: https://arxiv.org/abs/2510.09286
+Venue: arXiv:2510.09286v1
+HideCv: yes
+Type: note
+Issue: 2025
+
+Id: amarilli2025complexity
+Title: On the Complexity of Language Membership for Probabilistic Words
+Authors: me mikael praphael ssalvati
+Url: https://arxiv.org/abs/2510.08127
+Status: submitted
+Data: words
+Query: PQE, CFG
+
Id: amarilli2025tighter
Oldid: amarilli2022tighter amarilli2023tighter amarilli2024tighter
Title: Tighter Bounds for Query Answering with Guarded TGDs
