The following pages link to On uniformity within \(NC^ 1\) (Q2640342):
Displaying 50 items.
- Completeness results for graph isomorphism. (Q1401960) (← links)
- A second-order system for polytime reasoning based on Grädel's theorem. (Q1412837) (← links)
- Circuits and expressions with nonassociative gates (Q1567406) (← links)
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits (Q1567407) (← links)
- On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology (Q1603641) (← links)
- Multi-head finite automata: Data-independent versus data-dependent computations (Q1608894) (← links)
- First-order expressibility of languages with neutral letters or: The Crane Beach conjecture (Q1776372) (← links)
- Lower bounds for invariant queries in logics with counting. (Q1853505) (← links)
- Counting modulo quantifiers on finite structures (Q1854352) (← links)
- Uniform constant-depth threshold circuits for division and iterated multiplication. (Q1872733) (← links)
- On the complexity of inducing categorical and quantitative association rules (Q1884923) (← links)
- Arithmetical definability and computational complexity (Q1885035) (← links)
- Bounding the space in P systems with active membranes (Q1982967) (← links)
- Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits (Q1987509) (← links)
- On the complexity of the clone membership problem (Q2048213) (← links)
- Dynamic complexity of expansion (Q2117075) (← links)
- A logical characterization of constant-depth circuits over the reals (Q2148775) (← links)
- Iterated multiplication in \(VTC^0\) (Q2155497) (← links)
- Descriptive complexity of \#P functions: a new perspective (Q2220444) (← links)
- A model-theoretic characterization of constant-depth arithmetic circuits (Q2273012) (← links)
- A topological approach to non-uniform complexity (Q2280323) (← links)
- The conjugacy problem in free solvable groups and wreath products of abelian groups is in \(\mathsf{TC}^0\) (Q2311889) (← links)
- Open induction in a bounded arithmetic for \(\mathrm{TC}^{0}\) (Q2339958) (← links)
- Generating some classes of recursive functions by superpositions of simple arithmetic functions (Q2377524) (← links)
- Quantified propositional calculus and a second-order theory for NC\(^{\text \textbf{1}}\) (Q2388433) (← links)
- Maintenance goals of agents in a dynamic environment: formulation and policy construction (Q2389664) (← links)
- The conjugacy problem in free solvable groups and wreath products of abelian groups is in \({\mathsf {TC}^0}\) (Q2399376) (← links)
- Some lower bounds in parameterized \(\mathrm{AC}^{0}\) (Q2417855) (← links)
- A characterization of definability of second-order generalized quantifiers with applications to non-definability (Q2453584) (← links)
- Descriptive complexity of deterministic polylogarithmic time and space (Q2662676) (← links)
- Elementary analytic functions in \(\mathsf{VT}\mathsf{C}^0\) (Q2700809) (← links)
- Number of variables is equivalent to space (Q2758055) (← links)
- Division in logspace-uniform NC (Q2773023) (← links)
- A Language-Theoretical Approach to Descriptive Complexity (Q2817376) (← links)
- Expressive completeness for LTL with modulo counting and group quantifiers (Q2825418) (← links)
- The complexity of the comparator circuit value problem (Q2828221) (← links)
- On the locality of arb-invariant first-order formulas with modulo counting quantifiers (Q2974792) (← links)
- A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups (Q2975255) (← links)
- Dynamic Complexity of the Dyck Reachability (Q2988373) (← links)
- Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth (Q3012845) (← links)
- Typed Monoids – An Eilenberg-Like Theorem for Non Regular Languages (Q3014933) (← links)
- The Complexity of Counting Quantifiers on Equality Languages (Q3188273) (← links)
- Theories of arithmetics in finite models (Q3370752) (← links)
- Indistinguishability and First-Order Logic (Q3502636) (← links)
- A Characterization of NC k by First Order Functional Programs (Q3502640) (← links)
- On Second-Order Monadic Groupoidal Quantifiers (Q3511462) (← links)
- Extensional Uniformity for Boolean Circuits (Q3540171) (← links)
- A Characterisation of NL Using Membrane Systems without Charges and Dissolution (Q3543341) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG] (Q3618574) (← links)
