Pages that link to "Item:Q1164622"

The following pages link to Number of quantifiers is better than number of tape cells (Q1164622):

Displaying 50 items.

• A survey of stochastic \(\omega \)-regular games (Q414898) (← links)
• Two-way automata making choices only at the endmarkers (Q476168) (← links)
• Quantitative fair simulation games (Q528184) (← links)
• Doomsday equilibria for omega-regular games (Q528193) (← links)
• Finite-model theory -- A personal perspective (Q688663) (← links)
• Inherent complexity of recursive queries (Q696953) (← links)
• CEGAR for compositional analysis of qualitative properties in Markov decision processes (Q746785) (← links)
• On the definability of properties of finite graphs (Q791548) (← links)
• First-order spectra with one variable (Q909462) (← links)
• Stochastic limit-average games are in EXPTIME (Q933752) (← links)
• Isomorphisms and 1-L reductions (Q1107310) (← links)
• Descriptive characterizations of computational complexity (Q1123616) (← links)
• Upper and lower bounds for first order expressibility (Q1173404) (← links)
• The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems (Q1185244) (← links)
• Capturing complexity classes by fragments of second-order logic (Q1193408) (← links)
• An optimal lower bound on the number of variables for graph identification (Q1204528) (← links)
• Logical and schematic characterization of complexity classes (Q1323362) (← links)
• Dyn-FO: A parallel, dynamic complexity class (Q1376403) (← links)
• Model-checking iterated games (Q1674862) (← links)
• Reasoning about graded strategy quantifiers (Q1706169) (← links)
• Complexity of weak acceptance conditions in tree automata. (Q1853134) (← links)
• Hierarchies in transitive closure logic, stratified Datalog and infinitary logic (Q1919531) (← links)
• Discrete-time control for rectangular hybrid automata (Q1960531) (← links)
• Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives (Q2029600) (← links)
• Pruning external minimality checking for answer set programs using semantic dependencies (Q2046045) (← links)
• Algorithms and conditional lower bounds for planning problems (Q2238604) (← links)
• Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives (Q2248060) (← links)
• A survey of partial-observation stochastic parity games (Q2248075) (← links)
• The model checking fingerprints of CTL operators (Q2317834) (← links)
• Hyperplane separation technique for multidimensional mean-payoff games (Q2361356) (← links)
• On the universal and existential fragments of the \(\mu\)-calculus (Q2368950) (← links)
• Concurrent reachability games (Q2465027) (← links)
• Expand, enlarge and check: new algorithms for the coverability problem of WSTS (Q2581762) (← links)
• Descriptive complexity of deterministic polylogarithmic time and space (Q2662676) (← links)
• On the unusual effectiveness of logic in computer science (Q2736585) (← links)
• Bounds for the Quantifier Depth in Finite-Variable Logics (Q2946761) (← links)
• Reasoning About Substructures and Games (Q2957764) (← links)
• Optimal Reachability in Divergent Weighted Timed Games (Q2988366) (← links)
• Specification and Verification of Multi-Agent Systems (Q3166991) (← links)
• Graph Games and Reactive Synthesis (Q3176385) (← links)
• A Dynamic Algorithm for Reachability Games Played on Trees (Q3182948) (← links)
• Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition (Q3189650) (← links)
• Universal quantifiers and time complexity of random access machines (Q3699679) (← links)
• Discrete-time control for rectangular hybrid automata (Q4571988) (← links)
• The dimension of the negation of transitive closure (Q4842619) (← links)
• (Q5015274) (← links)
• Deciding Parity Games in Quasi-polynomial Time (Q5073521) (← links)
• (Q5136330) (← links)
• (Q5141616) (← links)
• (Q5743484) (← links)