Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Barlag, Timon"'
We characterize the computational power of neural networks that follow the graph neural network (GNN) architecture, not restricted to aggregate-combine GNNs or other particular types. We establish an exact correspondence between the expressivity of G
Externí odkaz:
http://arxiv.org/abs/2402.17805
We discover a connection between finding subset-maximal repairs for sets of functional and inclusion dependencies, and computing extensions within argumentation frameworks (AFs). We study the complexity of the existence of a repair and deciding wheth
Externí odkaz:
http://arxiv.org/abs/2312.01973
Semiring semantics for first-order logic provides a way to trace how facts represented by a model are used to deduce satisfaction of a formula. Team semantics is a framework for studying logics of dependence and independence in diverse contexts such
Externí odkaz:
http://arxiv.org/abs/2303.07926
We present an adapted construction of algebraic circuits over the reals introduced by Cucker and Meer to arbitrary infinite integral domains and generalize the $\mathrm{AC}_{\mathbb{R}}$ and $\mathrm{NC}_{\mathbb{R}}$-classes for this setting. We giv
Externí odkaz:
http://arxiv.org/abs/2302.13764
Autor:
Barlag, Timon, Vollmer, Heribert
In this paper we give an Immerman's Theorem for real-valued computation. We define circuits operating over real numbers and show that families of such circuits of polynomial size and constant depth decide exactly those sets of vectors of reals that c
Externí odkaz:
http://arxiv.org/abs/2005.04916
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.