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)- Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits
- Linear circuits, two-variable logic and weakly blocked monoids
- Permanent does not have succinct polynomial size arithmetic circuits of constant depth
- Arithmetizing uniform \(NC\)
- Bounding the space in P systems with active membranes
- Root finding with threshold circuits
- Lower bounds for invariant queries in logics with counting.
- Reductions to graph isomorphism
- Quantified propositional calculus and a second-order theory for NC\(^{\text \textbf{1}}\)
- Generating some classes of recursive functions by superpositions of simple arithmetic functions
- The equivalence of theories that characterize ALogTime
- A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem
- scientific article; zbMATH DE number 6970796 (Why is no real title available?)
- The complexity of intersecting finite automata having few final states
- Resource trade-offs in syntactically multilinear arithmetic circuits
- Dynamic complexity of expansion
- Reductions in circuit complexity: An isomorphism theorem and a gap theorem
- A note on the relation between polynomial time functionals and Constable's class \(\mathcal K\)
- First order logic, fixed point logic and linear order
- Relations among parallel and sequential computation models
- Expressive power of SQL.
- The dynamic complexity of transitive closure is in DynTC\(^{0}\).
- Completeness results for graph isomorphism.
- Circuit complexity and the expressive power of generalized first-order formulas
- A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups
- Dynamic complexity of the Dyck reachability
- Descriptive complexity of \#P functions: a new perspective
- Circuit complexity before the dawn of the new millennium
- Parallel complexity of iterated morphisms and the arithmetic of small numbers
- scientific article; zbMATH DE number 7471669 (Why is no real title available?)
- A note on uniform circuit lower bounds for the counting hierarchy (extended abstract)
- Constant-Round Interactive Proof Systems for AC0[2] and NC1
- Reachability and distances under multiple changes
- Model-checking hierarchical structures
- Counting quantifiers, successor relations, and logarithmic space
- AND and/or OR: uniform polynomial-size circuits
- A logic for constant-depth circuits
- The computational power of membrane systems under tight uniformity conditions
- A constant-space sequential model of computation for first-order logic
- Expressibility and Nonuniform Complexity Classes
- Uniform constant-depth threshold circuits for division and iterated multiplication.
- A second-order system for polytime reasoning based on Grädel's theorem.
- On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology
- On adaptive DLOGTIME and POLYLOGTIME reductions
- Number of variables is equivalent to space
- \(NC^ 1\): The automata-theoretic viewpoint
- A constant-space sequential model of computation for first-order logic
- The conjugacy problem in free solvable groups and wreath products of abelian groups is in \(\mathsf{TC}^0\)
- Relating polynomial time to constant depth
- On the power of built-in relations in certain classes of program schemes
- On the complexity of inducing categorical and quantitative association rules
- Deciding bisimilarity is P-complete
- Machines, Computations, and Universality
- Counting modulo quantifiers on finite structures
- Notions of locality and their logical characterizations over finite models
- Nondeterministic NC^1 computation
- Lower bounds for DNF-refutations of a relativized weak pigeonhole principle
- Typed monoids -- an Eilenberg-like theorem for non regular languages
- A characterisation of \textbf{P} by \textbf{DLOGTIME}-uniform families of polarizationless P systems using only dissolution rules
- On the parallel parameterized complexity of MaxSAT variants
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits
- A language-theoretical approach to descriptive complexity
- Methods for proving completeness via logical reductions
- A Characterisation of NL Using Membrane Systems without Charges and Dissolution
- Reductions to Graph Isomorphism
- A Characterization of NC k by First Order Functional Programs
- Indistinguishability and First-Order Logic
- The intersection problem for finite semigroups
- On the language of primitive words
- Circuits and expressions with nonassociative gates
- Achieving new upper bounds for the hypergraph duality problem through logic
- The complexity of computing maximal word functions
- The exact complexity of projective image matching
- On Second-Order Monadic Groupoidal Quantifiers
- The descriptive complexity approach to LOGCFL
- Extensions of MSO and the monadic counting hierarchy
- The parallel complexity of two problems on concurrency
- Maintenance goals of agents in a dynamic environment: formulation and policy construction
- Arithmetical definability and computational complexity
- Rudimentary reductions revisited
- A logical characterization of constant-depth circuits over the reals
- Some results on uniform arithmetic circuit complexity
- On the synchronization of semi-traces
- scientific article; zbMATH DE number 7378666 (Why is no real title available?)
- Descriptional and Computational Complexity of Finite Automata
- Computation models and function algebras
- An optimal lower bound on the number of variables for graph identification
- Context-sensitive transitive closure operators
- Theories of arithmetics in finite models
- Iterated multiplication in \(VTC^0\)
- Succinct representation, leaf languages, and projection reductions
- Division in logspace-uniform NC
- On the locality of arb-invariant first-order formulas with modulo counting quantifiers
- The lower reaches of circuit uniformity
- First order extensions of residue classes and uniform circuit complexity
- Open induction in a bounded arithmetic for \(\mathrm{TC}^{0}\)
- Extensions to Barrington's M-program model
- First-order expressibility of languages with neutral letters or: The Crane Beach conjecture
- Regular languages in \(NC\)
- On the coincidence of complexity classes BPC and \(\text{TC}^0 \)
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)
