Borrow it
- African Studies Library
- Alumni Medical Library
- Astronomy Library
- Fineman and Pappas Law Libraries
- Frederick S. Pardee Management Library
- Howard Gotlieb Archival Research Center
- Mugar Memorial Library
- Music Library
- Pikering Educational Resources Library
- School of Theology Library
- Science & Engineering Library
- Stone Science Library
The Resource Feasible computations and provable complexity properties, Juris Hartmanis
Feasible computations and provable complexity properties, Juris Hartmanis
Resource Information
The item Feasible computations and provable complexity properties, Juris Hartmanis represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.This item is available to borrow from all library branches.
Resource Information
The item Feasible computations and provable complexity properties, Juris Hartmanis represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.
This item is available to borrow from all library branches.
- Language
- eng
- Extent
- 62 pages
- Isbn
- 9780898710274
- Label
- Feasible computations and provable complexity properties
- Title
- Feasible computations and provable complexity properties
- Statement of responsibility
- Juris Hartmanis
- Subject
-
- Berechnungskomplexität
- Berechnungskomplexität
- Complexité de calcul (Informatique)
- Complexité de calcul (informatique)
- Computabilidade E Modelos De Computacao
- Computational complexity
- Computational complexity
- Formal languages
- Formal languages
- Formele talen
- Komplexitätstheorie
- Komplexitätstheorie
- Langages formels
- Langages formels
- Machine theory
- Machine theory
- complexité calcul
- théorie complexité
- Automates mathématiques, Théorie des
- Language
- eng
- Cataloging source
- DLC
- http://library.link/vocab/creatorName
- Hartmanis, Juris
- Index
- no index present
- LC call number
- QA267
- LC item number
- .H35
- Literary form
- non fiction
- Nature of contents
- bibliography
- Series statement
- CBMS-NSF regional conference series in applied mathematics ; 30
- http://library.link/vocab/subjectName
-
- Machine theory
- Formal languages
- Computational complexity
- théorie complexité
- complexité calcul
- Automates mathématiques, Théorie des
- Langages formels
- Complexité de calcul (Informatique)
- Computational complexity
- Formal languages
- Machine theory
- Formele talen
- Computabilidade E Modelos De Computacao
- Langages formels
- Complexité de calcul (informatique)
- Berechnungskomplexität
- Komplexitätstheorie
- Berechnungskomplexität
- Komplexitätstheorie
- Label
- Feasible computations and provable complexity properties, Juris Hartmanis
- Bibliography note
- Bibliography: p. 61-62
- Carrier category
- volume
- Carrier category code
-
- nc
- Carrier MARC source
- rdacarrier
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Dimensions
- 26 cm.
- Extent
- 62 pages
- Isbn
- 9780898710274
- Lccn
- 78014744
- Media category
- unmediated
- Media MARC source
- rdamedia
- Media type code
-
- n
- System control number
- (OCoLC)4135502
- Label
- Feasible computations and provable complexity properties, Juris Hartmanis
- Bibliography note
- Bibliography: p. 61-62
- Carrier category
- volume
- Carrier category code
-
- nc
- Carrier MARC source
- rdacarrier
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Dimensions
- 26 cm.
- Extent
- 62 pages
- Isbn
- 9780898710274
- Lccn
- 78014744
- Media category
- unmediated
- Media MARC source
- rdamedia
- Media type code
-
- n
- System control number
- (OCoLC)4135502
Subject
- Berechnungskomplexität
- Berechnungskomplexität
- Complexité de calcul (Informatique)
- Complexité de calcul (informatique)
- Computabilidade E Modelos De Computacao
- Computational complexity
- Computational complexity
- Formal languages
- Formal languages
- Formele talen
- Komplexitätstheorie
- Komplexitätstheorie
- Langages formels
- Langages formels
- Machine theory
- Machine theory
- complexité calcul
- théorie complexité
- Automates mathématiques, Théorie des
Member of
Library Locations
-
African Studies LibraryBorrow it771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US42.350723 -71.108227
-
-
Astronomy LibraryBorrow it725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US42.350259 -71.105717
-
Fineman and Pappas Law LibrariesBorrow it765 Commonwealth Avenue, Boston, MA, 02215, US42.350979 -71.107023
-
Frederick S. Pardee Management LibraryBorrow it595 Commonwealth Avenue, Boston, MA, 02215, US42.349626 -71.099547
-
Howard Gotlieb Archival Research CenterBorrow it771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US42.350723 -71.108227
-
-
Music LibraryBorrow it771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350723 -71.108227
-
Pikering Educational Resources LibraryBorrow it2 Silber Way, Boston, MA, 02215, US42.349804 -71.101425
-
School of Theology LibraryBorrow it745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350494 -71.107235
-
Science & Engineering LibraryBorrow it38 Cummington Mall, Boston, MA, 02215, US42.348472 -71.102257
-
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.bu.edu/portal/Feasible-computations-and-provable-complexity/kj9b3R_gNOk/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/Feasible-computations-and-provable-complexity/kj9b3R_gNOk/">Feasible computations and provable complexity properties, Juris Hartmanis</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data - Experimental
Data Citation of the Item Feasible computations and provable complexity properties, Juris Hartmanis
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.bu.edu/portal/Feasible-computations-and-provable-complexity/kj9b3R_gNOk/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/Feasible-computations-and-provable-complexity/kj9b3R_gNOk/">Feasible computations and provable complexity properties, Juris Hartmanis</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>
