Pages that link to "Item:Q2051371"

The following pages link to Pierre Ohlmann (Q2051371):

Displaying 6 items.

• Lower bounds for arithmetic circuits via the Hankel matrix (Q2051372) (← links)
• The GKK algorithm is the fastest over simple mean-payoff games (Q2097231) (← links)
• (Q4636627) (← links)
• The Theory of Universal Graphs for Infinite Duration Games (Q5043588) (← links)
• Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games (Q5089201) (← links)
• (Q5874295) (← links)