On uniformity within NC^ 1
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4028925 (Why is no real title available?)
- scientific article; zbMATH DE number 4076666 (Why is no real title available?)
- scientific article; zbMATH DE number 3654376 (Why is no real title available?)
- scientific article; zbMATH DE number 3467028 (Why is no real title available?)
- scientific article; zbMATH DE number 3561239 (Why is no real title available?)
- scientific article; zbMATH DE number 3287733 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- A taxonomy of problems with fast parallel algorithms
- Alternation
- An Optimal Parallel Algorithm for Formula Evaluation
- Application of model theoretic games to discrete linear orders and finite automata
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Classifying regular events in symbolic logic
- Constant Depth Reducibility
- Expressibility and Parallel Complexity
- Families of recognizable sets corresponding to certain varieties of finite monoids
- Finite monoids and the fine structure of NC 1
- Languages that Capture Complexity Classes
- Log Depth Circuits for Division and Related Problems
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Nondeterministic Space is Closed under Complementation
- On Isomorphisms and Density of $NP$ and Other Complete Sets
- On uniform circuit complexity
- P-uniform circuit complexity
- Parallel computation with threshold functions
- Parity, circuits, and the polynomial-time hierarchy
- Relational queries computable in polynomial time
- Simulation of Parallel Random Access Machines by Circuits
- Superlinear lower bounds for bounded-width branching programs
- The polynomial-time hierarchy
- Weak Second‐Order Arithmetic and Finite Automata
- \(\Sigma_ 1^ 1\)-formulae on finite structures
Cited in
(only showing first 100 items - show all)- Descriptional and computational complexity of finite automata -- a survey
- Reductions to graph isomorphism
- On adaptive DLOGTIME and POLYLOGTIME reductions
- Methods for proving completeness via logical reductions
- scientific article; zbMATH DE number 4117877 (Why is no real title available?)
- \(NC^ 1\): The automata-theoretic viewpoint
- The complexity of solitaire
- The invariant problem for binary string structures and the parallel complexity theory of queries
- Linear circuits, two-variable logic and weakly blocked monoids
- A logic for constant-depth circuits
- The complexity of computing maximal word functions
- Counting quantifiers, successor relations, and logarithmic space
- Parallel complexity of iterated morphisms and the arithmetic of small numbers
- Adaptive logspace reducibility and parallel time
- The equivalence of theories that characterize ALogTime
- The computational power of membrane systems under tight uniformity conditions
- Gap-languages and log-time complexity classes
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits
- Context-sensitive transitive closure operators
- Typed monoids -- an Eilenberg-like theorem for non regular languages
- Counting modulo quantifiers on finite structures
- Deciding bisimilarity is P-complete
- An optimal lower bound on the number of variables for graph identification
- Model-checking hierarchical structures
- Rudimentary reductions revisited
- Uniform constant-depth threshold circuits for division and iterated multiplication.
- Lower bounds for DNF-refutations of a relativized weak pigeonhole principle
- RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS
- Descriptional and Computational Complexity of Finite Automata
- Division in logspace-uniform NC
- Extensions to Barrington's M-program model
- Completeness results for graph isomorphism.
- Arithmetizing uniform \(NC\)
- First-order expressibility of languages with neutral letters or: The Crane Beach conjecture
- Computing with infinitary logic
- On input read-modes of alternating Turing machines
- The expressiveness of a family of finite set languages
- The isomorphism conjecture for constant depth reductions
- The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
- First-order logics: some characterizations and closure properties
- The exact complexity of projective image matching
- Circuits and expressions with nonassociative gates
- On the complexity of some problems on groups input as multiplication tables
- Machines, Computations, and Universality
- Quantified propositional calculus and a second-order theory for NC\(^{\text \textbf{1}}\)
- Reductions to Graph Isomorphism
- Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG]
- The complexity of intersecting finite automata having few final states
- Permanent does not have succinct polynomial size arithmetic circuits of constant depth
- On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology
- Relationships among $PL$, $\#L$, and the determinant
- Succinct representation, leaf languages, and projection reductions
- Some results on uniform arithmetic circuit complexity
- Regular languages in \(NC\)
- The descriptive complexity approach to LOGCFL
- Resource trade-offs in syntactically multilinear arithmetic circuits
- Root finding with threshold circuits
- Nondeterministic \(NC^1\) computation
- The complexity of counting quantifiers on equality languages
- Multi-head finite automata: Data-independent versus data-dependent computations
- Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits
- Notions of locality and their logical characterizations over finite models
- scientific article; zbMATH DE number 2051828 (Why is no real title available?)
- Reductions in circuit complexity: An isomorphism theorem and a gap theorem
- Extensions of MSO and the monadic counting hierarchy
- Lower bounds against weakly-uniform threshold circuits
- On uniformity and circuit lower bounds
- Expressibility and Nonuniform Complexity Classes
- A characterization of definability of second-order generalized quantifiers with applications to non-definability
- Lindström quantifiers and leaf language definability
- The parallel complexity of two problems on concurrency
- Theories of arithmetics in finite models
- A characterisation of \textbf{P} by \textbf{DLOGTIME}-uniform families of polarizationless P systems using only dissolution rules
- A language-theoretical approach to descriptive complexity
- The lower reaches of circuit uniformity
- scientific article; zbMATH DE number 7378666 (Why is no real title available?)
- Open induction in a bounded arithmetic for \(\mathrm{TC}^{0}\)
- Extensional Uniformity for Boolean Circuits
- Expressive power of SQL.
- The dynamic complexity of transitive closure is in DynTC\(^{0}\).
- On the language of primitive words
- A constant-space sequential model of computation for first-order logic
- A topological approach to non-uniform complexity
- A recursion-theoretic characterisation of the positive polynomial-time functions
- scientific article; zbMATH DE number 3921320 (Why is no real title available?)
- Parameterized Parallel Computing and First-Order Logic
- The complexity of weakly recognizing morphisms
- Computation models and function algebras
- Achieving new upper bounds for the hypergraph duality problem through logic
- On the coincidence of complexity classes BPC and \(\text{TC}^0 \)
- Circuit complexity of regular languages
- On the parallel parameterized complexity of MaxSAT variants
- A constant-space sequential model of computation for first-order logic
- scientific article; zbMATH DE number 7471669 (Why is no real title available?)
- Expressive completeness for LTL with modulo counting and group quantifiers
- A query language for NC
- The complexity of the evaluation of complex algebra expressions
- A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups
- Dynamic complexity of the Dyck reachability
- Count-free Weisfeiler-Leman and group isomorphism
This page was built for publication: On uniformity within \(NC^ 1\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2640342)
