Algorithmic uses of the Feferman-Vaught Theorem

Annals of Pure and Applied Logic

Volumn 126, Issue 1-3 SPEC. ISS., 2004, Pages 159-213

  Makowsky, Janos A ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Clique width; Graph algorithms; Graph polynomials; Mondadic second order logic; Tree width

Indexed keywords

EID: 1642322895     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apal.2003.11.002     Document Type: Article

References (174)

1. M. Aigner, The Penrose polynomial of graphs and matroids, in: Surveys in Combinatorics, 2001 (Sussex), London Mathematical Society Lecture Note Series, Vol. 288, Cambridge University Press, Cambridge, 2001, pp. 11-46.
2. Andrzejak A. An algorithm for the Tutte polynomials of graphs of bounded treewidth Discrete Math. 190 1998 39-54
3. Arnborg S. Corneil D.G. Proskurowski A. Complexity of finding embedding in a k-tree SIAM. J. Algebraic Discrete Methods 8 1987 277-284
4. Arnborg S. Lagergren J. Seese D. Easy problems for tree decomposable graphs J. Algorithms 12 1991 308-340
5. Arratia R. Bollobas B. Sorkin G.B. The interlace polynomial: a new graph polynomial IBM Res. Rep. RC 21813 98165 1990 31
6. J. Barwise, S. Feferman (Eds.), Model-theoretic logics. Perspectives in Mathematical Logic, Springer, Berlin, 1985.
7. Bell J.L. Slomson A.B. Models and Ultraproducts: An Introduction 1969 North-Holland Amsterdam
8. Beth E.W. On Padoa's method in the theory of definitions Indag. Math. 15 1953 330-339
9. E.W. Beth, Observations métamathématiques sur les structures simplement ordonneés, in: Applications scientifiques de la logique mathématique, Collection de Logique Mathématique, Serie A, Vol. 5, Paris and Louvain, 1954, pp. 29-35.
10. Blatter C. Specker E. Recurrence relations for the number of labeled structures on a finite set In Börger E. Hasenjaeger G. Rödding D. (Eds.), In Logic and Machines: Decision Problems and Complexity Lecture Notes in Computer Science Vol. 171 1984 43-61 Springer Berlin
11. Bodlaender H. Treewidth: algorithmic techniques and results in: Privara I. Ruzicka P. (Eds.), Proc. 22nd Internat. Symp. on the Mathematical Foundation of Computer Science, MFCS'97 Lecture Notes in Computer Science Vol. 1295 1997 29-36 Springer Berlin
12. Bollobás B. Modern Graph Theory 1999 Springer Berlin
13. Bollobás B. Riordan O. A Tutte polynomial for coloured graphs Combin. Probab. Comput. 8 1999 45-94
14. Borie R.B. Parker R.G. Tovey C.A. Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families Algorithmica 7 1992 555-581
15. Brandstädt A. Le V. Spinrad J. Graph classes: a survey 1999 SIAM Monographs on Discrete Mathematics and Applications, SIAM Philadelphia, PA
16. Brylawski T. Oxley J. The Tutte polynomial and its applications in: White N. (Ed.), Matroid Applications 1992 123-225 Cambridge University Press Cambridge
17. Büchi J.R. Weak second-order arithmetic and finite automata Z. Math. Logik Grundl. Math. 6 1960 66-92
18. Büchi J.R. Mathematische Theorie des Verhaltens endlicher Automaten ZAMM 42 1962 9-16
19. Bürgisser P. Completeness and Reduction in Algebraic Complexity Algorithms and Computation in Mathematics Vol. 7 2000 Springer Berlin
20. C.C. Chang, H.J. Keisler, Model theory, Studies in Logic, Vol. 73, 3rd Edition, North-Holland, Amsterdam, 1990.
21. Clarke E.M. Grumberg O. Peled D. Model Checking 1999 MIT Press Cambridge, MA
22. Compton K.J. Henson C.W. A uniform method for proving lower bounds on the computational complexity of logical theories Ann. Pure Appl. Logic 48 1990 1-79
23. Compton K.J. Henson C.W. A uniform method for proving lower bounds and the computational complexity of logical theories in: Abramsky S. Gabbay D. Maibaum T. (Eds.), Handbook of Logic in Computer Science Vol. 5 2000 Oxford University Press Oxford
24. D.G. Corneil, M. Habib, J.-M. Lanlignel, B. Reed, U. Rotics, Polynomial time recognition of clique-width ≤ 3 graphs, in: Proc. LATIN'2000, Lecture Notes in Computer Science, Vol. 1776, Springer, Berlin, 2000, pp. 126-134.
25. D. Corneil, U. Rotics, On the relationship between clique-width and tree-width, in: Lecture Notes in Computer Science, Vol. 2204, 2001, pp. 78-90.
26. Courcelle B. Graph rewriting: an algebraic and logic approach in: van Leeuwen J. (Ed.), Handbook of Theoretical Computer Science Vol. 2 1990 142-193 Elsevier Amsterdam (Chapter 5)
27. Courcelle B. The monadic second-order logic of graphs I: recognizable sets of finite graphs Inform. Comput. 85 1990 12-75
28. Courcelle B. Monadic second order graph transductions: a survey Theoret. Comput. Sci. 126 1994 53-75
29. Courcelle B. Engelfriet J. Rozenberg G. Handle-rewriting hypergraph grammars J. Comput. System Sci. 46 1993 218-270
30. Courcelle B. Engelfriet J. A logical characterization of the sets of hypergraphs defined by hyperedge replacement grammars Math. Systems Theory 28 1995 515-552
31. Courcelle B. Makowsky J.A. Fusion on relational structures and the verification of monadic second order properties Math. Struct. Comput. Sci. 12 2 2002 203-235
32. Courcelle B. Makowsky J.A. Rotics U. Linear time solvable optimization problems on graph of bounded clique width, extended abstract in: Hromkovic J. Sykora O. (Eds.), Graph Theoretic Concepts in Computer Science, 24th Internat. Workshop, WG'98 Lecture Notes in Computer Science Vol. 1517 1998 1-16 Springer Berlin
33. Courcelle B. Makowsky J.A. Rotics U. Linear time solvable optimization problems on graphs of bounded clique-width Theory Comput. Systems 33 2 2000 125-150
34. Courcelle B. Makowsky J.A. Rotics U. On the fixed parameter complexity of graph enumeration problems definable in monadic second order logic Discrete Appl. Math. 108 1-2 2001 23-52
35. Courcelle B. Mosbah M. Monadic second-order evaluations on tree-decomposable graphs Theoret. Comput. Sci. 109 1993 49-82
36. Courcelle B. Olariu S. Upper bounds to the clique-width of graphs Discrete Appl. Math. 101 2000 77-114
37. Diestel R. Graph theory 1996 Graduate Texts in Mathematics, Springer Berlin
38. Doner J.E. Decidability of the weak second-order theory of two successors Notices Amer. Math. Soc. 12 1965 819 (Abstract)
39. J.E. Doner, A. Mostowski, A. Tarski, The elementary theory of well-ordering - A metamathematical study, in: A.J. Macintyre, L. Pacholski, J.B. Paris (Eds.), Logic Colloq. '77, Studies in Logic, 1978, pp. 1-54.
40. Downey R.G. Fellows M.F. Parametrized Complexity 1999 Springer Berlin
41. Ebbinghaus H.D. Flum J. Finite model theory 1995 Perspectives in Mathematical logic, Springer Berlin
42. Ebbinghaus H.D. Flum J. Thomas W. Mathematical logic 1980 Undergraduate Texts in Mathematics, Springer Berlin
43. Ehrenfeucht A. Application of games to some problems of mathematical logic Bull. Acad. Polon. Sci. Cl. III 5 1957 35-37
44. Ehrenfeucht A. An application of games to the completeness problem for formalized theories Fund. Math. 49 1961 129-141
45. Elgot C.C. Decision problems of finite automata design and related arithmetics Trans. Amer. Math. Soc. 98 1961 21-52
46. Ellis-Monaghan J. New results for the Martin polynomial J. Combin. Theory Ser. B 74 1998 326-352
47. J. Engelfriet, Context-free graph grammars, in: Handbook of Formal Languages, Vol. 3: Beyond Words, Springer, Berlin, 1997, pp. 125-213.
48. Engelfriet J. Heyker L.M. Leih G. Context-free graph languages of bounded degree are generated by Apex graph grammars Acta Inform. 31 1994 341-378
49. Engelfriet J. Rozenberg G. A comparison of boundary graph grammars and context-free hypergraph grammars Inform. and Comput. 84 1990 163-206
50. Ershov Yu. Lavrov L. Taǐmanov I.A. Taǐtslin M.A. Elementary theories Russian Math. Surveys 20 4 1965 35-105
51. Fagin R. Generalized first-order spectra and polynomial time recognizable sets Amer. Math. Soc. Proc. 7 1974 27-41
52. Farrell E.J. On a general class of graph polynomials J. Combin. Theory Ser. B 26 1979 111-122
53. S. Feferman, Some recent work of Ehrenfeucht and Fraïssé, Proc. Summer Institute of Symbolic Logic, Ithaca, 1957, pp. 201-209.
54. Feferman S. Persistent and invariant formulas for outer extensions Compositio Math. 20 1968 29-52
55. Feferman S. Infinitary properties, local functors, and systems of ordinal functions Hodges W. Conference in Mathematical Logic-London 1970 Lecture Notes in Mathematics Vol. 255 1972 63-97 Springer Berlin
56. S. Feferman, Applications of many-sorted interpolation theorems, in: L. Henkin, et al. (Eds.), Proc. Tarski Symp., Proc. Symp. in Pure Mathematics, Vol. 25, American Mathematical Society, Providence, RI, 1974, pp. 205-223.
57. Feferman S. Two notes on abstract model theory, I: properties invariant on the range of definable relations between structures Fund. Math. 82 1974 153-165
58. Feferman S. Two notes on abstract model theory, II: languages for which the set of valid sentences is s.i.i.d Fund. Math. 89 1975 153-165
59. S. Feferman, Alfred Tarski and a watershed meeting in logic: Cornell 1957, preprint, to appear as part of a chapter for a biography of Alfred Tarski, under preparation with Anita Burdman Feferman, 2003.
60. Feferman S. Kreisel G. Persistent and invariant formulas relative to theories of higher order Bull. Amer. Math. Soc. 72 1966 480-485
61. Feferman S. Vaught R. The first order properties of algebraic systems Fund. Math. 47 1959 57-103
62. Ferrante J. Rackoff C.W. The Computational Complexity of Logical Theories Lecture Notes in Mathematics Vol. 718 1979 Springer Berlin
63. E. Fischer, J.A. Makowsky, The Specker-Blatter theorem revisited, in preparation.
64. Fisher D.C. Solow A.E. Dependence polynomials Discrete Math. 82 1990 251-258
65. Flasiński M. Power properties of NLC graph grammars with polynomial membership problem Theoret. Comput. Sci. 201 1998 189-231
66. Flum J. Frick M. Grohe M. Query evaluation via tree-decompositions in: van den Bussche J. Vianu V. (Eds.), Database Theory - ICDT 2001 Lecture Notes in Computer Science Vol. 1973 2001 22-38 Springer Berlin
67. Fraïssé R. Sur quelques classifications des relations, basées sur les isomorphisms restraints, I: Études générale Publ. Sci. Univ. Alger Ser. A 2 1955 15-60
68. Fraïssé R. Sur quelques classifications des relations, basées sur les isomorphisms restraints, II: applications aux relations d'ordre, et constructions d'exemples montrant que les classifications sont distinctes Publ. Sci. Univ. Alger Ser. A 2 1955 273-295
69. Frayne T.E. Morel A.C. Scott D.S. Reduced direct products Fund. Math. 51 1962 195-228
70. Garey M.G. Johnson D.S. Computers and Intractability 1979 Mathematical Series, Freeman New York
71. Gessel I. Combinatorial proofs of congruences in: Jackson D.M. Vanstone S.A. (Eds.), Enumeration and Design 1984 157-197 Academic Press New York
72. A. Glikson, J.A. Makowsky, NCE graph grammars and clique-width, Accepted for presentation at WG'03, 2003.
73. Godsil C.D. Algebraic Combinatorics 1993 Chapman & Hall London
74. Golumbic M.C. Rotics U. On the clique-width of some perfect graph classes Internat. J. Foundations of Comput. Sci. 11 2000 423-443
75. Grohe M. Generalized model-checking for first-order logic in: Ferreira A. Reichel H. (Eds.), 18th STACS Lecture Notes in Computer Science Vol. 2010 2001 12-26 Springer Berlin
76. Gurevich Y. Modest theory of short chains, I J. Symbolic Logic 44 1979 481-490
77. Y. Gurevich, Monadic second order theories, in: Model-Theoretic Logics, Perspectives in Mathematical Logic, Springer, Berlin, 1985 (Chapter 14).
78. Gurevich Y. Rabinovich A. Definability and undefinability with real order at the background J. Symbolic Logic 65 2 2000 946-958
79. Gurevich Y. Rabinovich A. Definability in rationals with order in the background J. Logic Comput. 12 1 2002 1-11
80. Gutman I. Harary F. Generalizations of the matching polynomial Utilitas Math. 24 1983 97-106
81. Habel A. Hyperedge Replacement: Grammars and Languages Lecture Notes in Computer Science Vol. 643 1992 Springer Berlin
82. Halin R. S-functions for graphs J. Geom. 8 1976 171-186
83. Hausmann D. Korte B. Algorithmic versus axiomatic definitions of matroids Math. Programming Stud. 14 1981 98-111
84. P. Hlinený, Branch-width, parse trees, and monadic second order logic for matroids, 2002, preprint.
85. Hodges W. Model Theory Encyclopedia of Mathematics and its Applications Vol. 42 1993 Cambridge University Press Cambridge
86. Hoede C. Li X. Clique polynomials and independent set polynomials of graphs Discrete Math. 125 1994 219-228
87. Hopcroft J.E. Ullman J.D. Introduction to Automata Theory, Languages and Computation 1980 Addison-Wesley Series in Computer Science, Addison-Wesley Reading, MA
88. Immerman N. Descriptive complexity 1999 Graduate Texts in Computer Science, Springer Berlin
89. Jaeger F. Tutte polynomials and link polynomials Proc. Amer. Math. Soc. 103 1988 647-654
90. D.S. Johnson, A catalog of complexity classes, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. 1, Elsevier, Amsterdam, 1990 (Chapter 2).
91. Jónsson B. Universal relational systems Math. Scand. 4 1956 193-208
92. Jónsson B. On isomorphism types of groups and other algebraic systems Math. Scand. 5 1957 224-229
93. Jónsson B. Homogeneous universal relational systems Math. Scand. 8 1960 137-142
94. Kim C. A hierarchy of ence families of graph languages Theoret. Comput. Sci. 186 1997 157-169
95. Kim C. Efficient recognition algorithms for boundary and linear ence graph languages Acta Inform. 37 2001 619-623
96. Ladner R.E. Application of model theoretic games to discrete linear orders and finite automata Inform. Control 33 1977 281-303
97. H. Läuchli, A decision procedure for the weak second order theory of linear order, in: Logic Colloquium '66, North-Holland, Amsterdam, 1968, pp. 189-197.
98. Läuchli H. Leonhard J. On the elementary theory of order Fund. Math. 59 1966 109-116
99. C. Lautemann, Decomposition trees: structured graph representation and efficient algorithms, in: Proc. CAAP'88, Lecture Notes in Computer Science, Vol. 299, Springer, Berlin, 1988, pp. 28-39.
100. Leung J.Y.-T. Vornberger O. Witthoff J.D. On some variants of the bandwidth minimization problem SIAM J. Comput. 13 1984 650-667
101. Lindström P. On extensions of elementary logic Theoria 35 1969 1-11
102. Lotz M. Makowsky J.A. On the algebraic complexity of some families of coloured Tutte polynomials Adv. Appl. Math. 32 1-2 2004 327-349
103. Lovasz L. Plummer M. Matching Theory 1986 North-Holland Amsterdam
104. Mahajan S. Peters J.G. Regularity and locality in k-terminal graphs Dam 54 1994 229-250
105. Makowsky J.A. Some observations on uniform reduction for properties invariant on the range of definable relations Fund. Math. 99 1978 199-203
106. J.A. Makowsky, Compactness, embeddings and definability, in: Model-Theoretic Logics, Perspectives in Mathematical Logic, Springer, Berlin, 1985 (Chapter 18).
107. J.A. Makowsky, Colored Tutte polynomials and Kauffman brackets on graphs of bounded tree width, in: Proc. 12th Symp. on Discrete Algorithms, SIAM, Philadelphia, PA, 2001, pp. 487-495.
108. J.A. Makowsky, J.P. Mariño, Farrell polynomials on graphs of bounded tree width, Presented at FPSAC'01, 2000.
109. Makowsky J.A. Mariño J.P. Farrell polynomials on graphs of bounded treewidth Adv. Appl. Math. 30 2003 160-176
110. Makowsky J.A. Mariño J.P. The parametrized complexity of knot polynomials J. Comput. System Sci. 67 4 2003 742-756
111. Makowsky J.A. Pnueli Y. Arity vs. alternation in second order logic Ann. Pure Appl. Logic 78 2 1996 189-202
112. J.A. Makowsky, E.V. Ravve, Incremental model checking for decomposable structures, in: Mathematical Foundations of Computer Science (MFCS'95), Lecture Notes in Computer Science, Vol. 969, Springer, Berlin, 1995, pp. 540-551.
113. J.A. Makowsky, E.V. Ravve, Translation schemes and the fundamental problem of database design, in: Conceptual Modeling-ER'96, Lecture Notes in Computer Science, Vol. 1157, Springer, Berlin, 1996, pp. 5-26.
114. Makowsky J.A. Ravve E.V. Dependency preserving refinement and the fundamental problem of database design Data Knowledge Eng. 24 3 1997 277-312
115. 4's Internat. J. Foundations Comput. Sci. 10 1999 329-348
116. Malitz J. Infinitary analogs of theorems from first order model theory J. Symbolic Logic 36 1971 216-228
117. J. Mighton, Knot Theory on Bipartite Graphs, Ph.D. Thesis, Department of Mathematics, University of Toronto, Toronto, Canada, 1999.
118. F. Moller, A. Rabinovich, On the expressive power of CTL* in: LICS'99, IEEE, London, 1999, pp. 360-369.
119. Monk J.D. Mathematical logic 1976 Graduate Texts in Mathematics, Springer Berlin
120. Mostowski A. On direct products of theories J. Symbolic Logic 17 1952 1-31
121. Mostowski A. Tarski A. Arithmetical classes and types of well-ordered systems. preliminary report Bull. Amer. Math. Soc. 55 1949 65 Abstract
122. Mycielski J. Pudlák P. Stern A.S. A Lattice of Chapters of Mathematics Memoirs of the American Mathematical Society Vol. 426 1990 American Mathematical Society Providence, RI
123. S.D. Noble, Complexity of graph polynomials, Ph.D. Thesis, New College, Oxford University, England, 1997.
124. Noble S.D. Evaluating the Tutte polynomial for graphs of bounded tree-width Combin. Probab. Comput. 7 1998 307-321
125. J. Oxley, On the interplay between graphs and matroids, in: Surveys in Combinatorics, 2001, Sussex, London Mathematical Society Lecture Note Series, Vol. 288, Cambridge University Press, Cambridge, 2001, pp. 199-239.
126. J. Oxley, What is a matroid? Preprint available at http://www.math.lsu.edu/preprint/
127. Oxley J.G. Welsh D.J.A. Tutte polynomials computable in polynomial time Discrete Math. 109 1992 185-192
128. Rabin M.O. A simple method for undecidability proofs and some applications in: Bar Hillel Y. (Ed.), Logic, Methodology and Philosophy of Science II, Studies in Logic 1965 58-68 North-Holland Amsterdam
129. Rabin M. Decidability of second order theories and automata on infinite trees Trans. Amer. Math. Soc. 141 1969 1-35
130. A. Rabinovich, Composition theorems for recursively defined structures, Technical Report, Tel Aviv University, 1999.
131. A. Rabinovich, Composition theorems for generalized sums, preprint 2001. Available on http://http://www.math.tau.ac.il/~rabinoa/
132. A. Rabinovich, Selection and uniformization in generalized products, to appear in the Journal of the Interest Group in Pure and Applied Logic, 2004. Available on http://http://www.math.tau.ac.il/~rabinoa/
133. E.V. Ravve, Model Checking for various notions of products, Ph.D. Thesis, Department of Computer Science, Technion-Israel Institute of Technology, 1995.
134. E.V. Ravve, Database decomposition with translation schemes, Ph.D. Thesis, Department of Computer Science, Technion-Israel Institute of Technology, 1998.
135. Riordan J. An Introduction to Combinatorial Analysis 1958 Wiley New York
136. Robertson N. Seymour P.D. Graph minors. I. Excluding a forest J. Combin. Theory Ser. B 35 1983 39-61
137. Robertson N. Seymour P.D. Graph minors. V. Excluding a planar graph J. Combin. Theory Ser. B 41 1986 92-114
138. Robinson G.C. Welsh D.J.A. The computational complexity of matroid properties Math. Proc. Cambridge Phil. Soc. 87 1980 29-45
139. Rosenstein J.G. Linear Orderings 1982 Academic Press New York
140. G. Rozenberg (Ed.), Handbook of Graph Grammars and Computing by Graph Transformations, Vol. 1: Foundations, World Scientific, Singapore, 1997.
141. G. Rozenberg (Ed.), Handbook of Graph Grammars and Computing by Graph Transformations, Vol. 2: Applications, Languages, Tools, World Scientific, Singapore, 1999.
142. G. Rozenberg (Ed.), Handbook of Graph Grammars and Computing by Graph Transformations, Vol. 3: Concurrency, Parallelisms, and Distribution, World Scientific, Singapore, 1999.
143. Sachs H. Beziehungen zwischen den in einem Graphen enthaltenen Kreisen und seinem charakteristischen Polynom Publ. Math. Debrecen. 11 1964 119-134
144. Saxe J.B. Dynamic programming algorithms for recognizing small-bandwidth graphs in polynomial time SIAM J. Algebraic Discrete Methods 1 1980 363-369
145. Seese D. Zur Entscheidbarkeit der monadische Theorie 2, Stufe baumartiger Graphen W.Z. der Humbolt-Universität zu Berlin Math.-Nat. R. XXIV 6 1975 768-772
146. Seese D. Some graph theoretical operations and decidability Math. Nachr. 87 1979 15-21
147. Seese D. The structure of the models of decidable monadic theories of graphs Ann. Pure Appl. Logic 53 1991 169-195
148. Seese D. The structure of the models of decidable monadic theories of graphs Ann. Pure Appl. Logic 53 1991 169-195
149. Shelah S. The monadic theory of order Ann. Math. 102 1975 379-419
150. Shelah S. On the very weak 0-1 law for random graphs with orders J. Logic Comput. 6 1996 137-159
151. Specker E. Application of logic and combinatorics to enumeration problems in: Börger E. (Ed.), Trends in Theoretical Computer Science 1988 141-169 Computer Science Press Rockville, MD Reprinted in: Ernst Specker, Selecta, Birkhäuser, Basel, 1990, pp. 324-350
152. E. Specker, Personal communication, Zurich, August 2002.
153. Stockmeyer L. The polynomial time hierarchy Theoret. Comput. Sci. 3 1977 1-22
154. Straubing H. Finite automata, formal logic, and circuit complexity 1994 Progress in Theoretical Computer Science, Birkhäuser Basel
155. Szmielew W. Elementary properties of abelian groups Fund. Math. 41 1955 203-271
156. Tarski A. Arithmetical classes and types of algebraically closed and real-closed fields Bull. Amer. Math. Soc. 55 1949 63
157. Tarski A. Arithmetical classes and types of boolean algebras Bull. Amer. Math. Soc. 55 1949 64
158. Tarski A. Arithmetical classes and types of mathematical systems Bull. Amer. Math. Soc. 55 1949 63
159. Tarski A. Metamathematical aspects of arithmetical classes and types Bull. Amer. Math. Soc. 55 1949 63-64
160. Tarski A. Contribution to the theory of models, I Indag. Math. 16 1954 572-581
161. Tarski A. Mostowski A. Robinson R.M. Undecidable theories 1953 Studies in Logic and the Foundations of Mathematics, North-Holland Amsterdam
162. W. Thomas, Automata on infinite objects, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. 2, Elsevier, Amsterdam, 1990 (Chapter 4).
163. Trakhtenbrot B. Finite automata and the logic of monadic predicates Dokl. Akad. Nauk SSSR 140 1961 326-329
164. Turàn Gy. On the complexity of graph grammars Acta Cybernet. 6 3 1983 271-280
165. Tutte W.T. A contribution to the theory of chromatic polynomials Canad. J. Math. 6 1954 80-91
166. Valiant L.G. The complexity of computing the permanent Theoret. Comput. Sci. 8 1979 189-201
167. Valiant L.G. The complexity of enumeration and reliability problems SIAM J. Comput. 8 1979 410-421
168. L. Valiant, Reducibility by algebraic projections, in: Logic and Arithmetic: An International Symposium held in honour of Ernst Specker, L'enseignement Mathématique, Vol. 30, Université de Genève, 1982, pp. 365-380.
169. M. Vardi, The complexity of relational query languages, in: Proc. 14th ACM Symp. on Theory of Computing (STOC'82), ACM, San Francisco, 1982, pp. 137-146.
170. Las Vergnas M. Le polynôme de Martin d'un graphe eulerien Ann. Discrete Math. 17 1983 397-411
171. Wagner K. Über eine Eigenschaft der ebenen Komplexe Math. Ann. 114 1937 570-590
172. Wanke E. k-NLC graphs and polynomial algorithms Discrete Appl. Math. 54 1994 251-266
173. D.J.A. Welsh, Complexity: Knots, Colourings and Counting, London Mathematical Society Lecture Notes Series, Vol. 186, Cambridge University Press, Cambridge, 1993.
174. α-languages Bull. Acad. Polonaise Sci. Série Sci. Math. 17 1969 337-339