Pages that link to "Item:Q3449481"
From MaRDI portal
The following pages link to Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time (Q3449481):
Displayed 20 items.
- The fixed initial credit problem for partial-observation energy games is \textsc{Ack}-complete (Q344560) (← links)
- On decidability and complexity of low-dimensional robot games (Q2009641) (← links)
- Simple stochastic games with almost-sure energy-parity objectives are in NP and conp (Q2233425) (← links)
- Strategic reasoning with a bounded number of resources: the quest for tractability (Q2238736) (← links)
- Hyperplane separation technique for multidimensional mean-payoff games (Q2361356) (← links)
- Model checking and synthesis for branching multi-weighted logics (Q2423760) (← links)
- Reachability games with relaxed energy constraints (Q2672231) (← links)
- Bounding Average-Energy Games (Q2988367) (← links)
- Deciding Fast Termination for Probabilistic VASS with Nondeterminism (Q3297606) (← links)
- (Q3384876) (← links)
- (Q5020520) (← links)
- (Q5028465) (← links)
- State of the Art in Logics for Verification of Resource-Bounded Multi-Agent Systems (Q5049036) (← links)
- (Q5089289) (← links)
- Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions (Q5090979) (← links)
- Synthesis for Multi-weighted Games with Branching-Time Winning Conditions (Q5100749) (← links)
- (Q5111624) (← links)
- (Q5227517) (← links)
- (Q5875382) (← links)
- On the complexity of resource-bounded logics (Q5915568) (← links)