Complexity of node coverage games
From MaRDI portal
Publication:2344734
Recommendations
Cites work
- A Complexity Measure
- A course in game theory.
- A genealogy of control structures
- Automata, Languages and Programming
- Concurrent reachability games
- DAG-width
- DAG-Width and Parity Games
- scientific article; zbMATH DE number 3959244 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3502759 (Why is no real title available?)
- scientific article; zbMATH DE number 3590298 (Why is no real title available?)
- Introduction to Software Testing
- Logic for Programming, Artificial Intelligence, and Reasoning
- Methodology for the Generation of Program Test Data
- Recontamination does not help to search a graph
- Shortest paths without a map
- Testing Software Design Modeled by Finite-State Machines
- The complexity of searching a graph
- The complexity of theorem-proving procedures
- Transition graphs and the star-height of regular events
Cited in
(2)
This page was built for publication: Complexity of node coverage games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2344734)