The following pages link to On uniformity within \(NC^ 1\) (Q2640342):
Displaying 44 items.
- (Q3697652) (← links)
- Some results on uniform arithmetic circuit complexity (Q4285623) (← links)
- Adaptive logspace reducibility and parallel time (Q4327383) (← links)
- (Q4453869) (← links)
- (Q4553282) (← links)
- Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic (Q4637759) (← links)
- Relationships among $PL$, $\#L$, and the determinant (Q4889814) (← links)
- Notions of locality and their logical characterizations over finite models (Q4948541) (← links)
- A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem (Q4957916) (← links)
- (Q5002805) (← links)
- (Q5009552) (← links)
- (Q5028429) (← links)
- Parameterized Parallel Computing and First-Order Logic (Q5049039) (← links)
- On the synchronization of semi-traces (Q5055913) (← links)
- A recursion-theoretic characterisation of the positive polynomial-time functions (Q5079742) (← links)
- Parallel complexity of iterated morphisms and the arithmetic of small numbers (Q5096834) (← links)
- Constant-Round Interactive Proof Systems for AC0[2] and NC1 (Q5098783) (← links)
- Circuit complexity and the expressive power of generalized first-order formulas (Q5204302) (← links)
- The complexity of weakly recognizing morphisms (Q5223827) (← links)
- LINDSTRÖM QUANTIFIERS AND LEAF LANGUAGE DEFINABILITY (Q5248979) (← links)
- Where First-Order and Monadic Second-Order Logic Coincide (Q5278195) (← links)
- RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS (Q5404514) (← links)
- Reductions to Graph Isomorphism (Q5458831) (← links)
- LOWER BOUNDS FOR DNF-REFUTATIONS OF A RELATIVIZED WEAK PIGEONHOLE PRINCIPLE (Q5501765) (← links)
- Machines, Computations, and Universality (Q5710880) (← links)
- The Intersection Problem for Finite Semigroups (Q5859649) (← links)
- Circuit complexity of regular languages (Q5918477) (← links)
- The descriptive complexity approach to LOGCFL (Q5946058) (← links)
- On the complexity of some problems on groups input as multiplication tables (Q5956010) (← links)
- On the coincidence of complexity classes BPC and \(\text{TC}^0 \) (Q6043894) (← links)
- A query language for NC (extended abstract) (Q6064297) (← links)
- Formal languages and the NLP black box (Q6067322) (← links)
- Models of VTC0$\mathsf {VTC^0}$ as exponential integer parts (Q6096734) (← links)
- Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability (Q6102995) (← links)
- A characterisation of \textbf{P} by \textbf{DLOGTIME}-uniform families of polarizationless P systems using only dissolution rules (Q6162071) (← links)
- Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages (Q6169895) (← links)
- On the parallel parameterized complexity of MaxSAT variants (Q6535422) (← links)
- Count-free Weisfeiler-Leman and group isomorphism (Q6545240) (← links)
- The Ungar games (Q6548025) (← links)
- A note on the relation between polynomial time functionals and Constable's class \(\mathcal K\) (Q6560166) (← links)
- First order logic, fixed point logic and linear order (Q6560167) (← links)
- Relations among parallel and sequential computation models (Q6560351) (← links)
- Circuit complexity before the dawn of the new millennium (Q6567750) (← links)
- Reachability in fixed VASS: expressiveness and lower bounds (Q6629526) (← links)
