The following pages link to On uniform circuit complexity (Q1152951):
Displaying 50 items.
- The complexity of computing the number of strings of given length in context-free languages (Q1178713) (← links)
- Characterizing parallel hierarchies by reducibilities (Q1183416) (← links)
- Rudimentary reductions revisited (Q1183444) (← links)
- Expected parallel time and sequential space complexity of graph and digraph problems (Q1186789) (← links)
- A model classifying algorithms as inherently sequential with applications to graph searching (Q1187028) (← links)
- On the theory of average case complexity (Q1190984) (← links)
- The complexity of circuit value and network stability (Q1190989) (← links)
- Bounded arithmetic for NC, ALogTIME, L and NL (Q1192345) (← links)
- A survey of space complexity (Q1193412) (← links)
- Multiplication, division, and shift instructions in parallel random access machines (Q1193622) (← links)
- Upper bounds on recognition of a hierarchy of non-context-free languages (Q1193884) (← links)
- On iterated integer product (Q1198074) (← links)
- A very hard log-space counting class (Q1208403) (← links)
- Extensions to Barrington's M-program model (Q1208406) (← links)
- Unambiguity of circuits (Q1208408) (← links)
- On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs (Q1262768) (← links)
- Non-commutative arithmetic circuits: depth reduction and size lower bounds (Q1274913) (← links)
- Nondeterministic \(NC^1\) computation (Q1276170) (← links)
- A lower bound for monotone arithmetic circuits computing \(0-1\) permanent (Q1276316) (← links)
- Parallel on-line parsing in constant time per word (Q1314377) (← links)
- Nondeterministics circuits, space complexity and quasigroups (Q1318692) (← links)
- The complexity of computing maximal word functions (Q1321032) (← links)
- Relations among simultaneous complexity classes of nondeterministic and alternating Turing machines (Q1323339) (← links)
- Function-algebraic characterizations of log and polylog parallel time (Q1332666) (← links)
- Space-efficient recognition of sparse self-reducible languages (Q1337147) (← links)
- ALOGTIME and a conjecture of S. A. Cook (Q1353980) (← links)
- Expressing uniformity via oracles (Q1361886) (← links)
- Parallel evaluation of arithmetic circuits (Q1365929) (← links)
- On parallel hierarchies and \(R_k^i\) (Q1377627) (← links)
- Gap-languages and log-time complexity classes (Q1389651) (← links)
- On the parallel complexity of loops (Q1391751) (← links)
- Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms. (Q1401920) (← links)
- Circuits and expressions with nonassociative gates (Q1567406) (← links)
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits (Q1567407) (← links)
- Proofs of proximity for context-free languages and read-once branching programs (Q1640993) (← links)
- Local reduction (Q1641001) (← links)
- Evaluation of circuits over nilpotent and polycyclic groups (Q1750355) (← links)
- Constructing arrangements optimally in parallel (Q1802221) (← links)
- Separating NC along the \(\delta\) axis (Q1827390) (← links)
- Computing a context-free grammar-generating series (Q1854451) (← 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)
- Boolean grammars (Q1886037) (← links)
- Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing (Q1941704) (← links)
- Data independence of read, write, and control structures in PRAM computations (Q1975968) (← links)
- A characterization of alternating log time by ramified recurrence (Q1978645) (← links)
- On the complexity of the clone membership problem (Q2048213) (← links)
- Expander construction in \(\mathrm{VNC}^1\) (Q2187260) (← links)
- Parallel pointer machines (Q2366720) (← links)
- Uniform proofs of ACC representations (Q2402964) (← links)
