-
2
-
-
84947904777
-
Circuit complexity before the dawn of the new millennium
-
FST&TCS'96, Springer
-
E. Allender. Circuit complexity before the dawn of the new millennium. In FST&TCS'96, Springer LNCS vol. 1180, 1996, 1-18.
-
(1996)
LNCS
, vol.1180
, pp. 1-18
-
-
Allender, E.1
-
5
-
-
84948964358
-
On expressive power of unary counters
-
ICDT'97, Springer
-
M. Benedikt, H.J. Keisler. On expressive power of unary counters. ICDT'97, Springer LNCS 1186, 1997, pages 291-305.
-
(1997)
LNCS
, vol.1186
, pp. 291-305
-
-
Benedikt, M.1
Keisler, H.J.2
-
6
-
-
0000409564
-
An optimal lower bound on the number of variables for graph identification
-
J. Cai, M. Fürer and N. Immerman. An optimal lower bound on the number of variables for graph identification. Combinatorica 12 (1992), 389-410.
-
(1992)
Combinatorica
, vol.12
, pp. 389-410
-
-
Cai, J.1
Fürer, M.2
Immerman, N.3
-
7
-
-
84948978740
-
Local properties of query languages
-
Proc. Int. Conf. on Database Theory, Springer
-
G. Dong, L. Libkin, L. Wong. Local properties of query languages. Proc. Int. Conf. on Database Theory, Springer LNCS 1186, 1997, pages 140-154.
-
(1997)
LNCS
, vol.1186
, pp. 140-154
-
-
Dong, G.1
Libkin, L.2
Wong, L.3
-
8
-
-
85047943542
-
Extended logics: The general framework
-
J. Barwise and S. Feferman, editors, Springer-Verlag
-
H.-D. Ebbinghaus. Extended logics: the general framework. In J. Barwise and S. Feferman, editors, Model-Theoretic Logics, Springer-Verlag, 1985, pages 25-76.
-
(1985)
Model-Theoretic Logics
, pp. 25-76
-
-
Ebbinghaus, H.-D.1
-
10
-
-
0031164818
-
Counting quantifiers, successor relations, and logarithmic space
-
K. Etessami. Counting quantifiers, successor relations, and logarithmic space, JCSS, 54 (1997), 400-411.
-
(1997)
JCSS
, vol.54
, pp. 400-411
-
-
Etessami, K.1
-
11
-
-
0002787734
-
On monadic NP vs monadic co-NP
-
R. Fagin, L. Stockmeyer, M. Vardi, On monadic NP vs monadic co-NP, Information and Computation, 120 (1994), 78-92.
-
(1994)
Information and Computation
, vol.120
, pp. 78-92
-
-
Fagin, R.1
Stockmeyer, L.2
Vardi, M.3
-
13
-
-
0002876334
-
Logical hierarchies in PTIME
-
L. Hella. Logical hierarchies in PTIME. Inform.& Comput., 129 (1996), 1-19.
-
(1996)
Inform.& Comput.
, vol.129
, pp. 1-19
-
-
Hella, L.1
-
14
-
-
0023400985
-
Languages that capture complexity classes
-
N. Immerman. Languages that capture complexity classes. SIAM Journal of Computing 16 (1987), 760-778.
-
(1987)
SIAM Journal of Computing
, vol.16
, pp. 760-778
-
-
Immerman, N.1
-
15
-
-
0001613776
-
Describing graphs: A first order approach to graph canonization
-
Springer Verlag, Berlin
-
N. Immerman and E. Lander. Describing graphs: A first order approach to graph canonization. In "Complexity Theory Retrospective", Springer Verlag, Berlin, 1990.
-
(1990)
Complexity Theory Retrospective
-
-
Immerman, N.1
Lander, E.2
-
16
-
-
0030692571
-
On the forms of locality over finite models
-
Full paper Notions of locality and their logical characterization over finite models by L. Hella, L. Libkin and J. Nurmonen is available as Bell Labs Technical Memo
-
L. Libkin. On the forms of locality over finite models. In LICS'97, pages 204-215. Full paper "Notions of locality and their logical characterization over finite models" by L. Hella, L. Libkin and J. Nurmonen is available as Bell Labs Technical Memo.
-
LICS'97
, pp. 204-215
-
-
Libkin, L.1
-
17
-
-
0003300973
-
On winning strategies with unary quantifiers
-
J. Nurmonen. On winning strategies with unary quantifiers. J. Logic and Computation, 6 (1996), 779-798.
-
(1996)
J. Logic and Computation
, vol.6
, pp. 779-798
-
-
Nurmonen, J.1
-
18
-
-
78649825684
-
-
Private communication. DIMACS, July
-
M. Otto. Private communication. DIMACS, July 1997.
-
(1997)
-
-
Otto, M.1
-
19
-
-
0024019151
-
Parallel computation and threshold functions
-
I. Parberry and G. Schnitger. Parallel computation and threshold functions. JCSS 36 (1988), 278-302.
-
(1988)
JCSS
, vol.36
, pp. 278-302
-
-
Parberry, I.1
Schnitger, G.2
-
20
-
-
0031213341
-
Natural proofs
-
A. Razborov and S. Rudich. Natural proofs. JCSS 55 (1997), 24-35.
-
(1997)
JCSS
, vol.55
, pp. 24-35
-
-
Razborov, A.1
Rudich, S.2
-
21
-
-
0001820018
-
Graph connectivity and monadic NP
-
T. Schwentick. Graph connectivity and monadic NP. FOCS'94, pages 614-622.
-
FOCS'94
, pp. 614-622
-
-
Schwentick, T.1
-
22
-
-
84958055251
-
Graph connectivity, monadic NP and built-in relations of moderate degree
-
ICALP'95, Springer
-
T. Schwentick. Graph connectivity, monadic NP and built-in relations of moderate degree. In ICALP'95, Springer LNCS 944, 1995, pages 405-416.
-
(1995)
LNCS
, vol.944
, pp. 405-416
-
-
Schwentick, T.1
|