Hostname: page-component-5ffc9858b4-jvpz5 Total loading time: 0 Render date: 2025-03-24T20:23:37.672Z Has data issue: false hasContentIssue false
  • English
  • Français

B. A. Trahténbrot. Složnost algoritmov i vyčíslenij (Spéckurs dlá studéntov NGU)(Complexity of algorithms and computations (Special course for students of the Novosibirsk Government University)). Novosibirskij Gosudarstvénnyj Univérsitét, Novosibirsk1967, 258 pp., mimeographed.

Review products

B. A. Trahténbrot. Složnost algoritmov i vyčíslenij (Spéckurs dlá studéntov NGU)(Complexity of algorithms and computations (Special course for students of the Novosibirsk Government University)). Novosibirskij Gosudarstvénnyj Univérsitét, Novosibirsk1967, 258 pp., mimeographed.

Published online by Cambridge University Press:  12 March 2014

Jiří Bečvář
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Reviews
Information
The Journal of Symbolic Logic , Volume 35 , Issue 2 , June 1970 , pp. 337 - 339
Copyright
Copyright © Association for Symbolic Logic 1970

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)