-
1
-
-
0001416287
-
Reachability is harder for directed than for undirected finite graphs
-
Ajtai M., Fagin R. Reachability is harder for directed than for undirected finite graphs. J. Symbolic Logic. 55:1990;113-150.
-
(1990)
J. Symbolic Logic
, vol.55
, pp. 113-150
-
-
Ajtai, M.1
Fagin, R.2
-
2
-
-
0031095445
-
On winning strategies in Ehrenfeucht-Fraïssé games
-
Arora S., Fagin R. On winning strategies in Ehrenfeucht-Fraïssé games. Theoret. Comput. Sci. 174:1997;97-121.
-
(1997)
Theoret. Comput. Sci.
, vol.174
, pp. 97-121
-
-
Arora, S.1
Fagin, R.2
-
3
-
-
0026123004
-
On truth-table reducibility to SAT
-
Buss S. R., Hay L. On truth-table reducibility to SAT. Inform. and Comput. 91:1991;86-102.
-
(1991)
Inform. and Comput.
, vol.91
, pp. 86-102
-
-
Buss, S.R.1
Hay, L.2
-
4
-
-
0024142223
-
The Boolean hierarchy I: Structural properties
-
Cai J. Y., Gundermann T., Hartmanis J., Hemachandra L. A., Sewelson V., Wagner K., Wechsung G. The Boolean hierarchy I: Structural properties. SIAM J. Comput. 17:1988;1232-1252.
-
(1988)
SIAM J. Comput.
, vol.17
, pp. 1232-1252
-
-
Cai, J.Y.1
Gundermann, T.2
Hartmanis, J.3
Hemachandra, L.A.4
Sewelson, V.5
Wagner, K.6
Wechsung, G.7
-
6
-
-
0000880574
-
The monadic second order logic of graphs VI: On several representations of graphs by relational structures
-
Courcelle B. The monadic second order logic of graphs VI: On several representations of graphs by relational structures. Discrete Appl. Math. 54:1994;117-149.
-
(1994)
Discrete Appl. Math.
, vol.54
, pp. 117-149
-
-
Courcelle, B.1
-
8
-
-
84985321946
-
Second-order and inductive definability on finite structures
-
de Rougemont Michel. Second-order and inductive definability on finite structures. Z. Math. Logik Grundl. Math. 33:1987;47-63.
-
(1987)
Z. Math. Logik Grundl. Math.
, vol.33
, pp. 47-63
-
-
De Rougemont, M.1
-
9
-
-
0000918436
-
An application of games to the completeness problem for formalized theories
-
Ehrenfeucht A. An application of games to the completeness problem for formalized theories. Fund. Math. 49:1961;129-141.
-
(1961)
Fund. Math.
, vol.49
, pp. 129-141
-
-
Ehrenfeucht, A.1
-
11
-
-
0002188798
-
Generalized first-order spectra and polynomial-time recognizable sets
-
R. M. Karp.
-
Fagin R. Generalized first-order spectra and polynomial-time recognizable sets. Karp R. M. Complexity of Computation, SIAM-AMS Proceedings. 1974;43-73.
-
(1974)
Complexity of Computation, SIAM-AMS Proceedings
, pp. 43-73
-
-
Fagin, R.1
-
14
-
-
0031285805
-
Comparing the power of games on graphs
-
Fagin R. Comparing the power of games on graphs. Math. Logic Quart. 43:1997;431-455.
-
(1997)
Math. Logic Quart.
, vol.43
, pp. 431-455
-
-
Fagin, R.1
-
15
-
-
0002850509
-
Sur quelques classifications des systèmes de relations
-
Fraïssé R. Sur quelques classifications des systèmes de relations. Publ. Sci. Univ. Alger. Sér. A. 1:1954;35-182.
-
(1954)
Publ. Sci. Univ. Alger. Sér. A
, vol.1
, pp. 35-182
-
-
Fraïssé, R.1
-
19
-
-
0002650529
-
Model-theoretic methods in the study of elementary logic
-
J. Addison, L. Henkin, & A. Tarski. Amsterdam: North Holland
-
Hanf W. Model-theoretic methods in the study of elementary logic. Addison J., Henkin L., Tarski A. The Theory of Models. 1965;132-145 North Holland, Amsterdam.
-
(1965)
The Theory of Models
, pp. 132-145
-
-
Hanf, W.1
-
24
-
-
0000055363
-
Substitution decomposition for discrete structures and connections with combinatorial optimization
-
Möhring R. H., Radermacher F. J. Substitution decomposition for discrete structures and connections with combinatorial optimization. Ann. Discrete Math. 19:1984;257-356.
-
(1984)
Ann. Discrete Math.
, vol.19
, pp. 257-356
-
-
Möhring, R.H.1
Radermacher, F.J.2
-
25
-
-
85031558819
-
1
-
1, Informa. Process. Lett., 53, (1995), 337-339.
-
Informa. Process. Lett., 53, (1995), 337-339.
-
-
Matz, O.1
Schweikardt, N.2
Thomas, W.3
-
26
-
-
0343654467
-
-
Personal communication
-
O. Matz, and, W. Thomas, Personal communication, 1997.
-
(1997)
-
-
Matz, O.1
Thomas, W.2
-
30
-
-
0030563350
-
On winning Ehrenfeucht games and monadic NP
-
Schwentick T. On winning Ehrenfeucht games and monadic NP. Annals Pure Appl. Logic. 79:1996;61-92.
-
(1996)
Annals Pure Appl. Logic
, vol.79
, pp. 61-92
-
-
Schwentick, T.1
-
31
-
-
0000416481
-
The monadic quantifier alternation hierarchy over grids and pictures
-
Schweikardt N. The monadic quantifier alternation hierarchy over grids and pictures. Lecture Notes in Computer Science. 1414:1997;441-460.
-
(1997)
Lecture Notes in Computer Science
, vol.1414
, pp. 441-460
-
-
Schweikardt, N.1
-
33
-
-
0039472150
-
4-trees and substitution decomposition
-
4-trees and substitution decomposition. Discrete Appl. Math. 39:1992;263-291.
-
(1992)
Discrete Appl. Math.
, vol.39
, pp. 263-291
-
-
Spinrad, J.1
-
34
-
-
44649167785
-
The polynomial-time hierarchy
-
Stockmeyer L. J. The polynomial-time hierarchy. Theoret. Comput. Sci. 3:1977;1-22.
-
(1977)
Theoret. Comput. Sci.
, vol.3
, pp. 1-22
-
-
Stockmeyer, L.J.1
-
35
-
-
0011401101
-
On the definability of properties of finite graphs
-
Turán G. On the definability of properties of finite graphs. Discrete Math. 49:1984;291-302.
-
(1984)
Discrete Math.
, vol.49
, pp. 291-302
-
-
Turán, G.1
-
36
-
-
0025507099
-
Bounded query classes
-
Wagner K. W. Bounded query classes. SIAM J. Comput. 19:1990;833-846.
-
(1990)
SIAM J. Comput.
, vol.19
, pp. 833-846
-
-
Wagner, K.W.1
-
37
-
-
0002499893
-
Complete sets and the polynomial-time hierarchy
-
Wrathall C. Complete sets and the polynomial-time hierarchy. Theoret. Comp. Sci. 3:1977;23-33.
-
(1977)
Theoret. Comp. Sci.
, vol.3
, pp. 23-33
-
-
Wrathall, C.1
|