The following pages link to Alternation (Q3928246):
Displaying 50 items.
- Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits (Q276257) (← links)
- Bounded situation calculus action theories (Q286407) (← links)
- Hypersequent rules with restricted contexts for propositional modal logics (Q344801) (← links)
- Towards more expressive ontology languages: the query answering problem (Q359987) (← links)
- A survey of timed automata for the development of real-time systems (Q394966) (← links)
- Branching-time model-checking of probabilistic pushdown automata (Q394999) (← links)
- Model-checking hierarchical structures (Q414908) (← links)
- Computation as an unbounded process (Q418791) (← links)
- An alternating hierarchy for finite automata (Q442279) (← links)
- The dag-width of directed graphs (Q444380) (← links)
- A dynamic deontic logic for complex contracts (Q444496) (← links)
- An \(\mathsf{AC}^{1}\)-complete model checking problem for intuitionistic logic (Q475340) (← links)
- Two-way automata making choices only at the endmarkers (Q476168) (← links)
- Lower bounds against weakly-uniform threshold circuits (Q486977) (← links)
- The complexity of debate checking (Q493647) (← links)
- Alternating space is closed under complement and other simulations for sublogarithmic space (Q515583) (← links)
- The complexity of controlling candidate-sequential elections (Q526900) (← links)
- Quasi-interpretations. A way to control resources (Q541228) (← links)
- A logic for reasoning about counterfactual emotions (Q543627) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- On state-alternating context-free grammars (Q557822) (← links)
- Automata on infinite objects and their applications to logic and programming (Q582913) (← links)
- The strong exponential hierarchy collapses (Q584250) (← links)
- Computational inductive definability (Q598276) (← links)
- Information tracking in games on graphs (Q616037) (← links)
- Complexity of equations over sets of natural numbers (Q633764) (← links)
- Coalgebraic semantics of modal logics: an overview (Q639647) (← links)
- On the computational complexity of behavioral description-based web service composition (Q650907) (← links)
- Hardness of preorder checking for basic formalisms (Q650916) (← links)
- On adaptive DLOGTIME and POLYLOGTIME reductions (Q672322) (← links)
- On input read-modes of alternating Turing machines (Q672377) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- Nondeterministic, probabilistic and alternating computations on cellular array models (Q673634) (← links)
- The complexity of pursuit on a graph (Q673639) (← links)
- Optimal simulation of two-dimensional alternating finite automata by three-way nondeterministic Turing machines (Q673641) (← links)
- On the equivalence of recursive and nonrecursive Datalog programs (Q676421) (← links)
- The complexity of querying indefinite data about linearly ordered domains (Q676427) (← links)
- Reusing and modifying rulebases by predicate substitution (Q676430) (← links)
- Probabilistic polynomials, AC\(^ 0\) functions and the polynomial-time hierarchy (Q685431) (← links)
- Interactive proof systems and alternating time-space complexity (Q685437) (← links)
- Arithmetization: A new method in structural complexity theory (Q685721) (← links)
- Continuous alternation: the complexity of pursuit in continuous domains (Q686740) (← links)
- Partial orders on words, minimal elements of regular languages, and state complexity (Q688156) (← links)
- If not empty, NP-P is topologically large (Q688157) (← links)
- On the complexity of queries in the logical data model (Q688665) (← links)
- Recursively indefinite databases (Q688672) (← links)
- Hypertree decompositions and tractable queries (Q696962) (← links)
- Logical aspects of Cayley-graphs: the group case (Q705541) (← links)
- Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems (Q729822) (← links)
- LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata (Q736618) (← links)
