Pages that link to "Item:Q5705923"
From MaRDI portal
The following pages link to Logic for Programming, Artificial Intelligence, and Reasoning (Q5705923):
Displayed 22 items.
- An algorithmic metatheorem for directed treewidth (Q266806) (← links)
- The dag-width of directed graphs (Q444380) (← links)
- Parity games on undirected graphs (Q456183) (← links)
- The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs (Q477199) (← links)
- The variable hierarchy for the games \(\mu \)-calculus (Q636308) (← links)
- Digraph decompositions and monotonicity in digraph searching (Q638540) (← links)
- Graph operations on parity games and polynomial-time algorithms (Q906273) (← links)
- Entanglement and the complexity of directed graphs (Q1929212) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- An extended tree-width notion for directed graphs related to the computation of permanents (Q2254501) (← links)
- Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) (← links)
- Estimation of the complexity of the potential transformation algorithm for solving cyclic games on graphs (Q2290510) (← links)
- Complexity of node coverage games (Q2344734) (← links)
- Digraph width measures in parameterized algorithmics (Q2442211) (← links)
- An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents (Q3007631) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- Finite Automata, Digraph Connectivity, and Regular Expression Size (Q3520302) (← links)
- The Descriptive Complexity of Parity Games (Q3540190) (← links)
- On Digraph Width Measures in Parameterized Algorithmics (Q3656861) (← links)
- Polynomial-Time Under-Approximation of Winning Regions in Parity Games (Q4982057) (← links)
- Digraph Decompositions and Monotonicity in Digraph Searching (Q5302067) (← links)
- Undirected Graphs of Entanglement 2 (Q5458861) (← links)