The following pages link to (Q4131648):
Displaying 12 items.
- Feferman-vaught decompositions for prefix classes of first order logic (Q6117143) (← links)
- Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic (Q6135954) (← links)
- On the complexity of robust multi-stage problems with discrete recourse (Q6180695) (← links)
- Quantified Boolean Solving for Achievement Games (Q6488139) (← links)
- Incremental dead state detection in logarithmic time (Q6535537) (← links)
- On the bounded theories of finite trees (Q6560360) (← links)
- Towards logical foundations for probabilistic computation (Q6560995) (← links)
- Topological network-control games (Q6591627) (← links)
- Solution complexity of local variants of sabotage game (Q6601766) (← links)
- On the difference set of two transductions (Q6614018) (← links)
- Checking history-determinism is NP-hard for parity automata (Q6629459) (← links)
- Block languages and their bitmap representations (Q6666792) (← links)