The following pages link to (Q3888985):
Displaying 16 items.
- Interval logics and their decision procedures. I: An interval logic (Q671639) (← links)
- Deciding the inequivalence of context-free grammars with 1-letter terminal alphapet is \(\sum ^ p_ 2\)-complete (Q761043) (← links)
- The complexity of the satisfiability problem for Krom formulas (Q800915) (← links)
- On classes of tractable unrestricted regular expressions (Q1061498) (← links)
- On the complexity of theories of permutations (Q1088647) (← links)
- The complementation problem for Büchi automata with applications to temporal logic (Q1088653) (← links)
- Isomorphisms and 1-L reductions (Q1107310) (← links)
- The complexity of reasoning about knowledge and time. I: Lower bounds (Q1119565) (← links)
- A 3n-lower bound on the network complexity of Boolean functions (Q1142030) (← links)
- Complexity results for classes of quantificational formulas (Q1157324) (← links)
- Practical decidability (Q1227003) (← links)
- On the equivalence, containment, and covering problems for the regular and context-free languages (Q1229100) (← links)
- The polynomial-time hierarchy (Q1236109) (← links)
- On the complexity of some two-person perfect-information games (Q1248466) (← links)
- The complexity of PDL with interleaving (Q1351943) (← links)
- Asymptotical behaviour of some non-uniform measures (Q3833644) (← links)