Pages that link to "Item:Q4207580"

The following pages link to Expressibility and Parallel Complexity (Q4207580):

Displaying 43 items.

• Model-checking hierarchical structures (Q414908) (← links)
• The computational power of membrane systems under tight uniformity conditions (Q537860) (← links)
• Low-complexity aggregation in GraphLog and Datalog (Q688669) (← links)
• First-order logics: some characterizations and closure properties (Q715044) (← links)
• The parallel complexity of two problems on concurrency (Q811123) (← links)
• Reversal complexity revisited (Q935164) (← links)
• Rudimentary reductions revisited (Q1183444) (← links)
• The invariant problem for binary string structures and the parallel complexity theory of queries (Q1191022) (← links)
• Capturing complexity classes by fragments of second-order logic (Q1193408) (← links)
• Diagonalization, uniformity, and fixed-point theorems (Q1201287) (← links)
• Reflective relational machines (Q1271557) (← links)
• A constant-space sequential model of computation for first-order logic (Q1271562) (← links)
• Two-coloring linked lists is NC\(^ 1\)-complete for logarithmic space (Q1318772) (← links)
• ALOGTIME and a conjecture of S. A. Cook (Q1353980) (← links)
• Circuits in bounded arithmetic. I (Q1353986) (← links)
• Recursion theoretic characterizations of complexity classes of counting functions (Q1365942) (← links)
• Reachability and the power of local ordering (Q1367543) (← links)
• Dyn-FO: A parallel, dynamic complexity class (Q1376403) (← links)
• A query language for NC (Q1376409) (← links)
• Nondeterministic stack register machines (Q1391527) (← links)
• Separating NC along the \(\delta\) axis (Q1827390) (← links)
• A logic-based approach to incremental reasoning on multi-agent systems (Q2089459) (← links)
• Dynamic complexity of expansion (Q2117075) (← links)
• A logical characterization of constant-depth circuits over the reals (Q2148775) (← links)
• A topological approach to non-uniform complexity (Q2280323) (← links)
• Open induction in a bounded arithmetic for \(\mathrm{TC}^{0}\) (Q2339958) (← links)
• A note on some languages in uniform \(ACC^ 0\) (Q2638770) (← links)
• On uniformity within \(NC^ 1\) (Q2640342) (← links)
• Number of variables is equivalent to space (Q2758055) (← links)
• A Language-Theoretical Approach to Descriptive Complexity (Q2817376) (← links)
• Extensions of an idea of McNaughton (Q3489464) (← links)
• Extensional Uniformity for Boolean Circuits (Q3540171) (← links)
• A Characterisation of NL Using Membrane Systems without Charges and Dissolution (Q3543341) (← links)
• Some results on uniform arithmetic circuit complexity (Q4285623) (← links)
• Computational Power of Quantum Machines, Quantum Grammars and Feasible Computation (Q4488251) (← links)
• Reasoning and Query Answering in Description Logics (Q4647812) (← links)
• Capturing complexity classes with Lindström quantifiers (Q5096870) (← links)
• Computing with Spikes: The Advantage of Fine-Grained Timing (Q5157248) (← links)
• PARALLEL VERTEX COLOURING OF INTERVAL GRAPHS (Q5248988) (← links)
• The descriptive complexity approach to LOGCFL (Q5946058) (← links)
• Logics capturing relativized complexity classes uniformly (Q6064295) (← links)
• A query language for NC (extended abstract) (Q6064297) (← links)
• Circuit complexity before the dawn of the new millennium (Q6567750) (← links)