T
Themistoklis Melissourgos
Researcher at University of Liverpool
Publications - 30
Citations - 126
Themistoklis Melissourgos is an academic researcher from University of Liverpool. The author has contributed to research in topics: Computer science & Nash equilibrium. The author has an hindex of 5, co-authored 22 publications receiving 68 citations. Previous affiliations of Themistoklis Melissourgos include Technische Universität München.
Papers
More filters
Journal ArticleDOI
Computing exact solutions of consensus halving and the Borsuk-Ulam theorem
TL;DR: A new complexity class is defined, called BU, which captures all problems that can be reduced to solving an instance of the Borsuk-Ulam problem exactly, and that LinearBU = PPA, where LinearBU is the subclass of BU in which the BORSuk- Ulam instance is specified by a linear arithmetic circuit.
Posted Content
Approximating the Existential Theory of the Reals
TL;DR: The main theorem is a sampling theorem, similar to those that have been proved for approximate equilibria in normal form games, that states that if an ETR problem has an exact solution, then it has a k-uniform approximate solution, where k depends on various properties of the formula.
Proceedings ArticleDOI
Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem
TL;DR: A new complexity class BU is defined, which captures all problems that can be reduced to solving an instance of the Borsuk-Ulam problem exactly, and it is shown that FIXP $\subseteq$ BU $\sub seteq$ TFETR and that LinearBU $=$ PPA, where LinearBU is the subclass of BU in which the BORSuk- Ulam instance is specified by a linear arithmetic circuit.
Proceedings ArticleDOI
Constant inapproximability for PPA
TL;DR: In this paper , it was shown that ε-consensus-halving is PPA-complete for any constant ε < 1/5, even when the parameter ε is a constant.
Posted Content
Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem
TL;DR: In this article, it was shown that the problem of finding an exact solution to the consensus halving problem is FIXP-hard, and deciding whether there exists a solution with fewer than $n$ cuts is ETR-complete.