AbstractWe show the containment of several classes of languages in NC1. These include the binary encodings of semilinear sets and some subclasses of context-free languages. We also investigate the closure properties of NC1
Non-uniform complexity measures originated in automata and formal languages theory are characterized...
Boolean circuits were introduced in complexity theory to provide a model for parallel computation. A...
AbstractThis article surveys the links between regular languages and the class NC1, showing their im...
AbstractWe show the containment of several classes of languages in NC1. These include the binary enc...
AbstractWe show that any language recognized by an NC1 circuit (fan-in 2, depth O(log n)) can be rec...
AbstractWe define the counting classes #NC1,GapNC1,PNC1, andC=NC1. We prove that boolean circuits, a...
In this paper we initiate the study of proof systems where verification of proofs proceeds by NC cir...
The class NC consists of problems solvable very fast (in time polynomial in log n) in parallel with ...
AbstractThe class NC1 of problems solvable by bounded fan-in circuit families of logarithmic depth i...
supported by the project Teorias e linguagens de programação para computações com recursos limit...
AbstractTwo properties, called semi-unboundedness and polynomial proof-size, are identified as key p...
We give several characterizations, in terms of formal logic, semigroup theory, and operations on lan...
AbstractControl grammars, a generalization of context-free grammars recently introduced for use in n...
AbstractWe argue that uniform circuit complexity introduced by Borodin is a reasonable model of para...
AbstractWe give several characterizations, in terms of formal logic, semigroup theory, and operation...
Non-uniform complexity measures originated in automata and formal languages theory are characterized...
Boolean circuits were introduced in complexity theory to provide a model for parallel computation. A...
AbstractThis article surveys the links between regular languages and the class NC1, showing their im...
AbstractWe show the containment of several classes of languages in NC1. These include the binary enc...
AbstractWe show that any language recognized by an NC1 circuit (fan-in 2, depth O(log n)) can be rec...
AbstractWe define the counting classes #NC1,GapNC1,PNC1, andC=NC1. We prove that boolean circuits, a...
In this paper we initiate the study of proof systems where verification of proofs proceeds by NC cir...
The class NC consists of problems solvable very fast (in time polynomial in log n) in parallel with ...
AbstractThe class NC1 of problems solvable by bounded fan-in circuit families of logarithmic depth i...
supported by the project Teorias e linguagens de programação para computações com recursos limit...
AbstractTwo properties, called semi-unboundedness and polynomial proof-size, are identified as key p...
We give several characterizations, in terms of formal logic, semigroup theory, and operations on lan...
AbstractControl grammars, a generalization of context-free grammars recently introduced for use in n...
AbstractWe argue that uniform circuit complexity introduced by Borodin is a reasonable model of para...
AbstractWe give several characterizations, in terms of formal logic, semigroup theory, and operation...
Non-uniform complexity measures originated in automata and formal languages theory are characterized...
Boolean circuits were introduced in complexity theory to provide a model for parallel computation. A...
AbstractThis article surveys the links between regular languages and the class NC1, showing their im...
DOI
Add to ORKG