1 citations · 1 across the 1 of their papers we have counts for
3 papers
cs.CC2021
The Dynamic Complexity of Acyclic Hypergraph Homomorphisms
Nils Vortmeier, Ioannis Kokkinis
Finding a homomorphism from some hypergraph (or some relational structure) to another hypergraph is a fundamental problem in computer science. We show t…
cs.LO2019
Dynamic Complexity Meets Parameterised Algorithms
Jonas Schmidt, Thomas Schwentick, Nils Vortmeier +2
Dynamic Complexity studies the maintainability of queries with logical formulas in a setting where the underlying structure or database changes over time. Most often, these formula…
cs.LO2017★ 1 cited
The Complexity of Probabilistic Justification Logic
Ioannis Kokkinis
Probabilistic justification logic is a modal logic with two kind of modalities: probability measures and explicit justification terms. We present a tableau procedure that can be us…