Author:
Hemaspaandra Edith,Hemaspaandra Lane A.,Tantau Till,Watanabe Osamu
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Bang-Jensen, J., Gutin, G.: Generalizations of tournaments: A survey. J. Graph Theory 28(4), 171–202 (1998)
2. Barrington, D., Immerman, N., Straubing, H.: On uniformity within NC1. J. Comput. Syst. Sci. 41(3), 274–306 (1990)
3. Gál, A., Wigderson, A.: Boolean complexity classes versus their arithmetic analogs. Random Structures and Algorithms 9(1–2), 99–111 (1996)
4. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)
5. Gutin, G.: The radii of n-partite tournaments. Math. Notes 40, 414–417 (1986)