-
2
-
-
0024606026
-
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
-
Barrington, D.A.: Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. J. Comput. Syst. Sci. 38(1), 150-164 (1989)
-
(1989)
J. Comput. Syst. Sci.
, vol.38
, Issue.1
, pp. 150-164
-
-
Barrington, D.A.1
-
3
-
-
0026883419
-
Regular languages in NC1
-
Barrington, D.A.M., Compton, K.J., Straubing, H., Thérien, D.: Regular languages in NC1. J. Comput. Syst. Sci. 44(3), 478-499 (1992)
-
(1992)
J. Comput. Syst. Sci.
, vol.44
, Issue.3
, pp. 478-499
-
-
Barrington, D.A.M.1
Compton, K.J.2
Straubing, H.3
Thérien, D.4
-
4
-
-
0024092214
-
Finite monoids and the fine structure of NC1
-
Barrington, D.A.M., Thérien, D.: Finite monoids and the fine structure of NC1. J. ACM 35(4), 941-952 (1988)
-
(1988)
J. ACM
, vol.35
, Issue.4
, pp. 941-952
-
-
Barrington, D.A.M.1
Thérien, D.2
-
5
-
-
0025416824
-
Characterization of associative operations with prefix circuits of constant depth and linear size
-
Bilardi, G., Preparata, F.P.: Characterization of associative operations with prefix circuits of constant depth and linear size. SIAM J. Comput. 19(2), 246-255 (1990)
-
(1990)
SIAM J. Comput.
, vol.19
, Issue.2
, pp. 246-255
-
-
Bilardi, G.1
Preparata, F.P.2
-
6
-
-
0020984292
-
-
Chandra, A.K., Fortune, S., Lipton, R.J.: Lower bounds for constant depth circuits for prefix problems. In: Proc. of the 10th ICALP, pp. 109-117 (1983)
-
Chandra, A.K., Fortune, S., Lipton, R.J.: Lower bounds for constant depth circuits for prefix problems. In: Proc. of the 10th ICALP, pp. 109-117 (1983)
-
-
-
-
7
-
-
0020733354
-
Unbounded fan-in circuits and associative functions
-
Chandra, A.K., Fortune, S., Lipton, R.J.: Unbounded fan-in circuits and associative functions. J. Comput. Syst. Sci. 30, 222-234 (1985)
-
(1985)
J. Comput. Syst. Sci.
, vol.30
, pp. 222-234
-
-
Chandra, A.K.1
Fortune, S.2
Lipton, R.J.3
-
8
-
-
0020914609
-
-
Dolev, D., Dwork, C., Pippenger, N., Wigderson, A.: Superconcentrators, generalizers and generalized connectors with limited depth (preliminary version). In: Proc. of 15th STOC, pp. 42-51 (1983)
-
Dolev, D., Dwork, C., Pippenger, N., Wigderson, A.: Superconcentrators, generalizers and generalized connectors with limited depth (preliminary version). In: Proc. of 15th STOC, pp. 42-51 (1983)
-
-
-
-
9
-
-
0002127588
-
Parity, circuits and the polynomial time hierarchy
-
Furst, M., Saxe, J., Sipser, M.: Parity, circuits and the polynomial time hierarchy. Math. Syst. Theory 17, 13-27 (1984)
-
(1984)
Math. Syst. Theory
, vol.17
, pp. 13-27
-
-
Furst, M.1
Saxe, J.2
Sipser, M.3
-
10
-
-
84875567483
-
-
Håstad, J.: Almost optimal lower bounds for small depth circuits. In: Proc. of the 18th STOC, pp. 6-20 (1986)
-
Håstad, J.: Almost optimal lower bounds for small depth circuits. In: Proc. of the 18th STOC, pp. 6-20 (1986)
-
-
-
-
11
-
-
0029722957
-
-
Chaudhuri, S., Radhakrishnan, J.: Deterministic restrictions in circuit complexity. In: Proc. of the 28th STOC, pp. 30-36 (1996)
-
Chaudhuri, S., Radhakrishnan, J.: Deterministic restrictions in circuit complexity. In: Proc. of the 28th STOC, pp. 30-36 (1996)
-
-
-
-
12
-
-
34247484530
-
-
Koucký, M., Lautemann, C., Poloczek, S., Thérien, D.: Circuit lower bounds via Ehrenfeucht-Fraisse games. In: Proc. of the 21st IEEE Conference on Computational Complexity, pp. 190-201 (2006)
-
Koucký, M., Lautemann, C., Poloczek, S., Thérien, D.: Circuit lower bounds via Ehrenfeucht-Fraisse games. In: Proc. of the 21st IEEE Conference on Computational Complexity, pp. 190-201 (2006)
-
-
-
-
13
-
-
34247479597
-
-
Koucký, M., Pudlák, P., Thérien, D.: Bounded-depth circuits: Separating wires from gates. In: Proc. of the 37th STOC, pp. 257-265 (2005)
-
Koucký, M., Pudlák, P., Thérien, D.: Bounded-depth circuits: Separating wires from gates. In: Proc. of the 37th STOC, pp. 257-265 (2005)
-
-
-
-
15
-
-
0001335331
-
Syntactic semigroups
-
Chap. 10, G. Rozenberg and A. Salomaa (Eds.), Berlin: Springer
-
Pin, J.-E.: Syntactic semigroups. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Language Theory, vol. I, pp. 679-746. Springer, Berlin (1997). Chap. 10
-
(1997)
Handbook of Language Theory
, vol.I
, pp. 679-746
-
-
Pin, J.-E.1
-
17
-
-
0001013907
-
Communication in bounded depth circuits
-
Pudlák, P.: Communication in bounded depth circuits. Combinatorica 14(2), 203-216 (1994)
-
(1994)
Combinatorica
, vol.14
, Issue.2
, pp. 203-216
-
-
Pudlák, P.1
-
18
-
-
0026205731
-
Linear-size constant-depth polylog-threshold circuits
-
Ragde, P., Wigderson, A.: Linear-size constant-depth polylog-threshold circuits. Inf. Process. Lett. 39, 143-146 (1991)
-
(1991)
Inf. Process. Lett.
, vol.39
, pp. 143-146
-
-
Ragde, P.1
Wigderson, A.2
-
19
-
-
84875557742
-
-
Schwentick, T., Thérien, D., Vollmer, H.: Partially ordered two-way automata: a new characterization of DA. In: Proc. of DLT, pp. 242-253 (2001)
-
Schwentick, T., Thérien, D., Vollmer, H.: Partially ordered two-way automata: a new characterization of DA. In: Proc. of DLT, pp. 242-253 (2001)
-
-
-
-
20
-
-
0000201603
-
Families of recognizable sets corresponding to certain varieties of finite monoids
-
Straubing, H.: Families of recognizable sets corresponding to certain varieties of finite monoids. J. Pure Appl. Algebra 15(3), 305-318 (1979)
-
(1979)
J. Pure Appl. Algebra
, vol.15
, Issue.3
, pp. 305-318
-
-
Straubing, H.1
-
21
-
-
0000305750
-
On finite monoids having only trivial subgroups
-
Schützenberger, M.P.: On finite monoids having only trivial subgroups. Inf. Control 8(2), 190-194 (1965)
-
(1965)
Inf. Control
, vol.8
, Issue.2
, pp. 190-194
-
-
Schützenberger, M.P.1
-
22
-
-
23944497408
-
Diamonds are forever: The variety DA
-
G. Gomez, P. Silva, and J.-E. Pin (Eds.), Singapore: World Scientific
-
Tesson, P., Thérien, D.: Diamonds are forever: the variety DA. In: Gomez, G., Silva, P., Pin, J.-E. (eds.) Semigroups, Algorithms, Automata and Languages, pp. 475-500. World Scientific, Singapore (2002)
-
(2002)
Semigroups, Algorithms, Automata and Languages
, pp. 475-500
-
-
Tesson, P.1
Thérien, D.2
-
23
-
-
23944480981
-
Complete classifications for the communication complexity of regular languages
-
Tesson, P., Thérien, D.: Complete classifications for the communication complexity of regular languages. Theory Comput. Syst. 38(2), 135-159 (2005)
-
(2005)
Theory Comput. Syst.
, vol.38
, Issue.2
, pp. 135-159
-
-
Tesson, P.1
Thérien, D.2
-
24
-
-
26444479411
-
-
Tesson, P., Thérien, D.: Restricted two-variable sentences, circuits and communication complexity. In: Proc. of ICALP, pp. 526-538 (2005)
-
Tesson, P., Thérien, D.: Restricted two-variable sentences, circuits and communication complexity. In: Proc. of ICALP, pp. 526-538 (2005)
-
-
-
-
25
-
-
84875557383
-
-
Tesson, P., Thérien, D.: Bridges between algebraic automata theory and complexity theory. In: The Complexity Column, Bull. EATCS, vol. 88, pp. 37-64 (2006)
-
Tesson, P., Thérien, D.: Bridges between algebraic automata theory and complexity theory. In: The Complexity Column, Bull. EATCS, vol. 88, pp. 37-64 (2006)
-
-
-
-
26
-
-
0001631788
-
Classification of finite monoids: The language approach
-
Thérien, D.: Classification of finite monoids: the language approach. Theor. Comput. Sci. 14, 195-208 (1981)
-
(1981)
Theor. Comput. Sci.
, vol.14
, pp. 195-208
-
-
Thérien, D.1
-
27
-
-
0004107235
-
Introduction to circuit complexity-a uniform approach
-
An EATCS Series, Berlin: Springer
-
Vollmer, H.: Introduction to circuit complexity-a uniform approach. In: Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (1999)
-
(1999)
Texts in Theoretical Computer Science.
-
-
Vollmer, H.1
|