Skip to main content
SpringerLink
Log in

On problems solvable by successive trials

  • Invited Lectures
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975 (MFCS 1975)

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

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. Cook, S.A., The complexity of theorem-proving procedures. Third Annual ACM Symp. on Theory of Computing, 1971, 151–158.

    Google Scholar 

  2. Cook, S.A. and Reckhow, R., On the length of proofs in the propositional calculus. Sixth Annual ACM Symp. on Theory of Computing, 1974, 135–146.

    Google Scholar 

  3. Dekhtyar', M.I., Impossibility of eliminating complete enumeration in computing functions from their diagrams. Dokl.Akad. Nauk SSSR, 1969, Vol. 189, No.4, pp. 748–751.

    Google Scholar 

  4. Gill, J.T., Computational complexity of probabilistic Turing machines. Sixth Annual ACM Symp. on Theory of Computing, 1974, pp. 91–95.

    Google Scholar 

  5. Karp, R.M., Reducibility among combinatorial problems. In Complexity of computer computations, Miller and Thatcher (eds.), Plenum Press, 1973, pp. 85–109.

    Google Scholar 

  6. Lander, R.E., Polynomial time reducibilities. Fifth Annual ACM Symp. on Theory of Computing, 1973, pp. 122–129.

    Google Scholar 

  7. Lander, R., Lynch, N., Selman, A.L., Comparison of polynomial-time reducibilities. Sixth Annual ACM Symp. on Theory of Computing, 1974, pp. 110–121.

    Google Scholar 

  8. Levin, L.A., Universal trial problems. Problems of information transmission, 1973, 9, No.3, pp.115–116.

    Google Scholar 

  9. Rogers,Jr.H., Theory of recursive functions and effective computability, New York, 1967.

    Google Scholar 

  10. Stockmeyer, L.J., Meyer, A.R. Word problems requiring exponential time. Fifth Annual ACM Symp. on Theory of Computing, 1973, pp. 1–9.

    Google Scholar 

  11. Trakhtenbrot, B.A., Formalization of some notions in terms of computational complexity. In Logic, Methodology and Philosophy of Science IV, P.Suppes et al., eds., North-Holland Publ.Comp., 1973, pp.205–213.

    Google Scholar 

  12. Trakhtenbrot, B.A., Notes on computational complexity on probabilistic machines. In Theory of Algorithms and Mathematical Logic, Computing Centre of the USSR Academy of Sciences, Moscow, 1974, pp. 159–176.

    Google Scholar 

  13. Trakhtenbrot, B.A., Barzdin Ya.M., Finite automata (behaviour and synthesis), North-Holland, 1973.

    Google Scholar 

  14. Vaiser, A.B., On probabilistic machines and languages. Second All-Union Conference on Problems of Theoretical Cybernetics, Theses, Novosibirsk, 1971.

    Google Scholar 

  15. Yablonskii, S.V., On algorithmic difficulties in synthesis of minimal schemes. Problems of Cybernetics, 1959, 2, pp.75–121.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Siberian Branch of the USSR Academy of Sciences, Novosibirsk

    B. A. Trakhtenbrot

Authors
  1. B. A. Trakhtenbrot
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jíří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Trakhtenbrot, B.A. (1975). On problems solvable by successive trials. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975. MFCS 1975. Lecture Notes in Computer Science, vol 32. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07389-2_187

Download citation

  • DOI: https://doi.org/10.1007/3-540-07389-2_187

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07389-5

  • Online ISBN: 978-3-540-37585-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation