DeepAI AI Chat
Log In Sign Up

Dynamic Toolbox for ETRINV

by   Mikkel Abrahamsen, et al.
Københavns Uni

Recently, various natural algorithmic problems have been shown to be ∃R-complete. The reduction relied in many cases on the ∃R-completeness of the problem ETR-INV, which served as a useful intermediate problem. Often some strengthening and modification of ETR-INV was required. This lead to a cluttered situation where no paper included all the previous details. Here, we give a streamlined exposition in a self-contained manner. We also explain and prove various universality results regarding ETR-INV. These notes should not be seen as a research paper with new results. However, we do describe some refinements of earlier results which might be useful for future research. We plan to extend and update this exposition as seems fit.


page 1

page 2

page 3

page 4


Beyond the Existential Theory of the Reals

We show that completeness at higher levels of the theory of the reals is...

Downward Self-Reducibility in TFNP

A problem is downward self-reducible if it can be solved efficiently giv...

Phase Transitions of Plan Modification in Conformant Planning

We explore phase transitions of plan modification, which mainly focus on...

Bimodal logics with contingency and accident

Contingency and accident are two important notions in philosophy and phi...

Countdown games, and simulation on (succinct) one-counter nets

We answer an open complexity question by Hofman, Lasota, Mayr, Totzke (L...

Cost-Based Goal Recognition Meets Deep Learning

The ability to observe the effects of actions performed by others and to...

StoqMA meets distribution testing

𝖲𝗍𝗈𝗊𝖬𝖠 captures the computational hardness of approximating the ground e...