Skip to main content
SpringerLink
Log in

What can we do with problems of exhaustive search?

  • Conference paper
  • First Online:
Book cover Algorithms in Modern Mathematics and Computer Science

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 122))

  • 176 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Rogers H. Theory of recursive functions and effective computability. — McGraw Hill Co., 1967.

    Google Scholar 

  2. Слисенко А.О. Сложностные задачи теории вычислений. — М., 1979 (Препринт/Научн. совет по компл. проблеме "Кибернетика" АН СССР).

    Google Scholar 

  3. Fischer M.J., Rabin M.O. Super-exponential complexity of Presburger arithmetic. —In: Complexity Comput.: SIAM-AMS Proc., v.7, Providence, 1974, p. 27–41.

    Google Scholar 

  4. Cook S.A. The complexity of theorem-proving procedures. —In: Conf. Rec. 3d Annu. ACM Symp. Theory Comput., Shaker Heights, 1971, p. 151–158.

    Google Scholar 

  5. Aho A.V., Hopcroft J.E., Ullman J.D. The design and analysis of computer algorithms. — London a.o.: Addison Wesley, 1974.

    Google Scholar 

  6. Garey M.R., Johnson D.S., Tarjan R.E. The planar Hamiltonian circuit problem is NP-complete. — SIAM J. Comput., 1976, v.5, no.4, p. 704–714.

    Article  Google Scholar 

  7. Land A.H., Doig A.G. An automatic method of solving discrete programming problems. — Econometrica, 1960, v.28, no.3, p. 497–520.

    Google Scholar 

  8. Слисенко А.О. Финитный подход к задаче оптимизации алгорифмов установления выводимости. — Записки научн. семинаров Ленингр. отд. Матем. ин-та АН СССР, 1975, т.49, с. 123–130.

    Google Scholar 

  9. Lewis H.R. Complexity of solvable cases of decision problem for the predicate calculus. —In: IEEE 19th Annu. Symp. Found. Comput. Sci., Ann Arbor, 1978, p. 35–47.

    Google Scholar 

  10. Матросов В.М., Василъев С.Н., Каратуев В.Г., Новиков М.А., Суменков Е.А., Ядыкин С.А. Мащинный вывод теорем о динамических свойствах с вектор-функциями Ляпунова. — Кибернетика, 1979, No2, с. 27–36.

    Google Scholar 

  11. Калужнин Л.А., Стогний А.А. Теория и практика применения ЭВМ в алгебраических исследованиях. — В кн.: Вычисления в алгебре и комбинаторике, Киев, 1978, с. 3–40.

    Google Scholar 

  12. Стругацкий А.Н., Стругацкий Б.Н. Понедельник начинается в субботу. — В. кн.: Библиотека современной фантастики, т. 7, М., 1966.

    Google Scholar 

  13. Corneil D.G., Gotlieb C.C. An efficient algorithm for graph isomorphism. — J. Assoc. Comput. Mach., 1970, v.17, no.1, p. 51–64.

    Google Scholar 

  14. Slisenko A.O. Computational complexity of string and graph identification. — In: Lect. Notes Comput. Sci., 1979, v.74, p. 182–190.

    Google Scholar 

  15. Аделъсон-Велъский Г.М., Диниц Е.А., Карзанов А.В. Потоковые алгоритмы. — М.: Наука, 1975.

    Google Scholar 

  16. Galil Z., Naamad A. Network flow and generalized path compression. — In: Proc. 11th Annu. ACM Symp. Theory Comput., Atlanta, 1979, p. 13–26.

    Google Scholar 

  17. Hačijan L.G. A polynomial algorithm in linear programming. — Soviet Math. Dokl., 1979, v.20, no.1, p. 191–194.

    Google Scholar 

  18. Келлен Дж. Календарное планирование. — В кн.: Экономические модели в управлении. М., 1967.

    Google Scholar 

  19. Маслов. С.Ю. Информация в исчислении и рационализация переборов. — Кибернетика, 1979, No2, с. 20–26.

    Google Scholar 

  20. Sahni S., Gonzales T. P-complete problems and approximate solutions. — In: IEEE 15th Annu. Symp. Switch. and Automata Theory, New Orleans, 1974, p. 28–31.

    Google Scholar 

  21. Ibarra O.H., Kim C.E. Fast approximation algorithm for the knapsack and sum of subset problems. — J. Assoc. Comput. Mach., 1975, v.22, no.4, p. 463–468.

    Google Scholar 

  22. Christofides N. Worst-case analysis of a new heuristic for the traveling salesman problem. — In: Algorithms and complexity: New directions and recent results, ed. J. Traub. New York a.o., Academic Press, 1976, p. 441.

    Google Scholar 

  23. Нигматуллин Р.Г. Сложностъ приближенного решения комбинаторных задач. — Докл. АН СССР, 1975, т. 224, No2, с. 289–292.

    Google Scholar 

  24. Диниц Е.А., Карзанов А.В. Булева задача оптимизации при ограничениях одного знака. М., 1978, — 42 с. (Препринт/ВНИИ системных исследований).

    Google Scholar 

  25. Yao A.C.-C. Probabilistic computations: toward a unified measure of complexity. —In: IEEE 18th Annu. Symp. Found. Comput. Sci., Providence, 1977, p. 222–227.

    Google Scholar 

  26. Lueker G.S. Maximization problems on graphs with edge weights chosen from a normal distribution. —In: Proc. 10th Annu. ACM Symp. Theory Comput., San Diego, 1978, p. 13–19.

    Google Scholar 

  27. Гимади Э.Х., Глебов Н.И., Перепелица В.А. Алгоритмы с оценками для задач дискретной оптимизации. — В кн.: Проблемы кибернетики, М., 1976, вып.31, с. 35–42.

    Google Scholar 

  28. Angluin D., Valiant L.G. Fast probabilistic algorithms for Hamiltonian circuits and matching. — Edinburgh, 1977, — 59 p. (Univ. of Edinburgh, Dept. Comput. Sci., CSR-17-77).

    Google Scholar 

  29. Solovay R., Strassen V. A fast Monte-Carlo test for primality. — SIAM J. Comput., 1977, v.6, no.1, p. 84–85.

    Article  Google Scholar 

  30. Аделъсон-Велъский Г.М., Арлазаров В.Л., Донской М.В. Программирование игр. — М.: Наука, 1978.

    Google Scholar 

  31. Zermelo E. Uber eine Anwendung der Mengenlehre auf die Theorie des Schachspiel. —In: 5th Intern. Congress Mathem., Cambridge, v.2, 1912, p. 501.

    Google Scholar 

  32. Shannon C. Chess playing machine. — The world of math., 1956, no.4, p. 2124–2134.

    Google Scholar 

  33. Shannon C. Game playing machines. — J. Franklin Inst., 1955, v.260, no.6, p. 447–453.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. VNIISI, Krzhizhanovskogo 14-2, Moscow, USSR

    G. M. Adel'son-Vel'skii

  2. LOMI, Fontanka 27, Leningrad, USSR

    A. O. Slisenko

Authors
  1. G. M. Adel'son-Vel'skii
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. O. Slisenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrei P. Ershov Donald E. Knuth

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Adel'son-Vel'skii, G.M., Slisenko, A.O. (1981). What can we do with problems of exhaustive search?. In: Ershov, A.P., Knuth, D.E. (eds) Algorithms in Modern Mathematics and Computer Science. Lecture Notes in Computer Science, vol 122. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11157-3_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-11157-3_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11157-3

  • Online ISBN: 978-3-540-38621-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation