search result

Cover von A Faster Algorithm for Finding Tarski Fixed Points

A Faster Algorithm for Finding Tarski Fixed Points

Year: 2021
Media group: LIPIcs
Cover von Tree Polymatrix Games Are PPAD-Hard

Tree Polymatrix Games Are PPAD-Hard

Year: 2020
Media group: LIPIcs
Cover von Unique End of Potential Line

Unique End of Potential Line

Year: 2019
Media group: LIPIcs
Cover von Bounded Satisfiability for PCTL

Bounded Satisfiability for PCTL

Year: 2012
Media group: ARTICLE
Cover von Two Choices Are Enough for P-LCPs, USOs, and Colorful Tangents

Two Choices Are Enough for P-LCPs, USOs, and Colorful Tangents

Author: Weber, Simon
Year: 2024
Media group: LIPIcs
Cover von Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem

Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem

Year: 2019
Media group: LIPIcs
Cover von Reachability Switching Games

Reachability Switching Games

Year: 2018
Media group: LIPIcs
Cover von Efficient Approximation of Optimal Control for Continuous-Time Markov Games

Efficient Approximation of Optimal Control for Continuous-Time Markov Games

Year: 2011
Media group: ARTICLE
OPEN V 11.1.0.0