Advertisement

Keywords

Boolean Function Binary Sequence Finite Automaton Separation Principle Infinite Subset 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cook, S.A., The complexity of theorem-proving procedures. Third Annual ACM Symp. on Theory of Computing, 1971, 151–158.Google Scholar
  2. 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. 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. 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. 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. 6.
    Lander, R.E., Polynomial time reducibilities. Fifth Annual ACM Symp. on Theory of Computing, 1973, pp. 122–129.Google Scholar
  7. 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. 8.
    Levin, L.A., Universal trial problems. Problems of information transmission, 1973, 9, No.3, pp.115–116.Google Scholar
  9. 9.
    Rogers,Jr.H., Theory of recursive functions and effective computability, New York, 1967.Google Scholar
  10. 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. 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. 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. 13.
    Trakhtenbrot, B.A., Barzdin Ya.M., Finite automata (behaviour and synthesis), North-Holland, 1973.Google Scholar
  14. 14.
    Vaiser, A.B., On probabilistic machines and languages. Second All-Union Conference on Problems of Theoretical Cybernetics, Theses, Novosibirsk, 1971.Google Scholar
  15. 15.
    Yablonskii, S.V., On algorithmic difficulties in synthesis of minimal schemes. Problems of Cybernetics, 1959, 2, pp.75–121.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • B. A. Trakhtenbrot
    • 1
  1. 1.Institute of Mathematics, Siberian Branch of the USSR Academy of SciencesNovosibirsk

Personalised recommendations