A note on a theorem of Barrington, Straubing and Thérien (Q1351160): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4036704 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Superlinear lower bounds for bounded-width branching programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Non-uniform automata over groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finite monoids and the fine structure of <i>NC</i> <sup>1</sup> / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lower bounds for depth-three circuits with equals and mod-gates / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lower bounds on the size of bounded depth circuits over a complete basis with logical addition / rank | |||
Normal rank |
Latest revision as of 11:09, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on a theorem of Barrington, Straubing and Thérien |
scientific article |
Statements
A note on a theorem of Barrington, Straubing and Thérien (English)
0 references
27 February 1997
0 references
Computational complexity
0 references
Lower bounds
0 references
Polynomials
0 references
0 references