The following pages link to (Q4131648):
Displayed 50 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)
- Ordered vertex removal and subgraph problems (Q582090) (← links)
- The most nonelementary theory (Q598194) (← links)
- The complexity of node blocking for dags (Q616455) (← links)
- Observations on complete sets between linear time and polynomial time (Q627129) (← links)
- Complexity of equations over sets of natural numbers (Q633764) (← links)
- One-nonterminal conjunctive grammars over a unary alphabet (Q639852) (← links)
- Distributed XML design (Q657904) (← links)
- The complexity of pursuit on a graph (Q673639) (← links)
- Visibly linear temporal logic (Q682377) (← links)
- Three \(\sum^ P_ 2\)-complete problems in computational learning theory (Q685716) (← links)
- Minimizing finite automata is computationally hard (Q703578) (← links)
- Synchronous Kleene algebra (Q710676) (← links)
- Parsing Boolean grammars over a one-letter alphabet using online convolution (Q714852) (← links)
- The set of realizations of a max-plus linear sequence is semi-polyhedral (Q716317) (← links)
- On the shortest path game (Q729795) (← links)
- Deciding the inequivalence of context-free grammars with 1-letter terminal alphapet is \(\sum ^ p_ 2\)-complete (Q761043) (← links)
- Optimizing the region algebra is PSPACE-complete (Q765502) (← links)
- Finite complete rewriting systems and the complexity of word problem (Q791314) (← links)
- Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first order theories (Q793017) (← links)
- On the complexity of LL(k) testing (Q794445) (← links)
- Prohibiting repetitions makes playing games substantially harder (Q794942) (← links)
- The complexity of two-player games of incomplete information (Q800838) (← links)
- Backtracking games and inflationary fixed points (Q817842) (← links)
- On the complexity of timed pattern matching (Q832025) (← links)
- State complexity of projection on languages recognized by permutation automata and commuting letters (Q832938) (← links)
- On the complexity of kings (Q846367) (← links)
- The complexity of membership problems for circuits over sets of integers (Q861262) (← links)
- Frontiers of tractability for typechecking simple XML transformations (Q878753) (← links)
- On the minimization of XML schemas and tree automata for unranked trees (Q882435) (← links)