The following pages link to On uniformity within \(NC^ 1\) (Q2640342):
Displayed 50 items.
- The expressiveness of a family of finite set languages (Q672126) (← links)
- On adaptive DLOGTIME and POLYLOGTIME reductions (Q672322) (← links)
- Computing with infinitary logic (Q672337) (← links)
- On input read-modes of alternating Turing machines (Q672377) (← links)
- Methods for proving completeness via logical reductions (Q685391) (← links)
- \(NC^ 1\): The automata-theoretic viewpoint (Q685708) (← links)
- The parallel complexity of two problems on concurrency (Q811123) (← links)
- The equivalence of theories that characterize ALogTime (Q834715) (← links)
- The complexity of solitaire (Q1034532) (← links)
- Rudimentary reductions revisited (Q1183444) (← links)
- The graph of multiplication is equivalent to counting (Q1190513) (← links)
- The invariant problem for binary string structures and the parallel complexity theory of queries (Q1191022) (← links)
- Regular languages in \(NC\) (Q1191027) (← links)
- Deciding bisimilarity is P-complete (Q1203120) (← links)
- An optimal lower bound on the number of variables for graph identification (Q1204528) (← links)
- Extensions to Barrington's M-program model (Q1208406) (← links)
- A constant-space sequential model of computation for first-order logic (Q1271562) (← links)
- Succinct representation, leaf languages, and projection reductions (Q1271623) (← links)
- Relating polynomial time to constant depth (Q1274992) (← links)
- Reductions in circuit complexity: An isomorphism theorem and a gap theorem (Q1276160) (← links)
- Nondeterministic \(NC^1\) computation (Q1276170) (← links)
- On the power of built-in relations in certain classes of program schemes (Q1277684) (← links)
- Context-sensitive transitive closure operators (Q1319508) (← links)
- The complexity of computing maximal word functions (Q1321032) (← links)
- On the language of primitive words (Q1351946) (← links)
- Expressing uniformity via oracles (Q1361886) (← links)
- Counting quantifiers, successor relations, and logarithmic space (Q1362332) (← links)
- A query language for NC (Q1376409) (← links)
- The complexity of the evaluation of complex algebra expressions (Q1376410) (← links)
- Gap-languages and log-time complexity classes (Q1389651) (← links)
- Expressive power of SQL. (Q1401278) (← links)
- The dynamic complexity of transitive closure is in DynTC\(^{0}\). (Q1401284) (← links)
- 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)
- 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)
- Number of variables is equivalent to space (Q2758055) (← links)
- Division in logspace-uniform<i>NC</i><sup>1</sup> (Q2773023) (← links)
- Theories of arithmetics in finite models (Q3370752) (← links)