activity
20002026
most citedStrategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor

13 citations · 40 across the 21 of their papers we have counts for

collaborators
Showing 2020Show all

1 paper · 1 filter

cs.CC2020

On the Mysteries of MAX NAE-SAT

Joshua Brakensiek, Neng Huang, Aaron Potechin +1

MAX NAE-SAT is a natural optimization problem, closely related to its better-known relative MAX SAT. The approximability status of MAX NAE-SAT is almost completely understood if al…