The following pages link to (Q4131648):
Displayed 21 items.
- The complexity of synchronous notions of information flow security (Q278742) (← links)
- On the complexity of Boolean unification (Q293360) (← links)
- Equations over sets of integers with addition only (Q295632) (← links)
- Algorithms for Kleene algebra with converse (Q299194) (← links)
- On the decidability and complexity of problems for restricted hierarchical hybrid systems (Q338386) (← links)
- Deciding whether a regular language is generated by a splicing system (Q340586) (← links)
- A framework for modular ERDF ontologies (Q360258) (← links)
- Simplifying XML schema: single-type approximations of regular tree languages (Q389236) (← links)
- Bounded repairability of word languages (Q394744) (← links)
- Phutball is PSPACE-hard (Q410721) (← links)
- The tractability frontier for NFA minimization (Q414869) (← links)
- Synthesis of opaque systems with static and dynamic masks (Q453510) (← links)
- On the complexity of the closed fragment of Japaridze's provability logic (Q482919) (← links)
- Limitations of acyclic causal graphs for planning (Q490647) (← links)
- Complexity of fixed-size bit-vector logics (Q504997) (← links)
- Complexity of validity for propositional dependence logics (Q515658) (← links)
- Automata for unordered trees (Q515668) (← links)
- Succinctness of pattern-based schema languages for XML (Q532368) (← links)
- Semantics and complexity of recursive aggregates in answer set programming (Q543600) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- On the complexity of typechecking top-down XML transformations (Q555775) (← links)