David A. Mix Barrington

Available identifiers

zbMath Open mix-barrington.david-aMaRDI QIDQ386052

List of research outcomes

Publication	Date of Publication	Type
Lower bounds for modular counting by circuits with modular gates	2022-08-16	Paper
Corrigendum to: ``Uniform constant-depth threshold circuits for division and iterated multiplication	2013-12-13	Paper
Planar and grid graph reachability problems	2009-10-19	Paper
First-order expressibility of languages with neutral letters or: The Crane Beach conjecture	2005-05-12	Paper
Uniform constant-depth threshold circuits for division and iterated multiplication.	2003-05-14	Paper
Number of variables is equivalent to space	2001-12-06	Paper
Lower bounds for modular counting by circuits with modular gates	2000-12-19	Paper
https://portal.mardi4nfdi.de/entity/Q4938621	2000-04-25	Paper
A lower bound on the MOD 6 degree of the OR function	1999-04-06	Paper
Superlinear lower bounds for bounded-width branching programs	1995-08-21	Paper
Representing Boolean functions as polynomials modulo composite numbers	1995-04-06	Paper
Complex polynomials and circuit lower bounds for modular counting	1995-04-06	Paper
Some results on uniform arithmetic circuit complexity	1994-11-13	Paper
https://portal.mardi4nfdi.de/entity/Q4281556	1994-03-10	Paper
https://portal.mardi4nfdi.de/entity/Q4036704	1993-05-18	Paper
Regular languages in \(NC\)	1992-09-27	Paper
Oracle branching programs and Logspace versus \(P^*\)	1992-06-28	Paper
https://portal.mardi4nfdi.de/entity/Q3975161	1992-06-26	Paper
A note on some languages in uniform \(ACC^ 0\)	1991-01-01	Paper
On uniformity within \(NC^ 1\)	1990-01-01	Paper
Non-uniform automata over groups	1990-01-01	Paper
Extensions of an idea of McNaughton	1990-01-01	Paper
On the relative complexity of some languages in \(NC^ 1\)	1989-01-01	Paper
Finite monoids and the fine structure of NC 1	1988-01-01	Paper

Research outcomes over time

This page was built for person: David A. Mix Barrington