Skip to content
Texas A&M University Libraries
  • MyLibrary
  • Help

Libraries Catalog

Advanced
  • The computational complexity o...
  • Cite this
  • Text this
  • Email this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Permanent link
Cover Image

The computational complexity of equivalence and isomorphism problems /

Bibliographic Details
Main Author: Thierauf, Thomas
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: Berlin ; New York : Springer, [2000]
Series:Lecture notes in computer science ; 1852.
Subjects:
Computational complexity > Data processing.
Isomorphisms (Mathematics) > Data processing.
problème isomorphisme.
algorithme équivalence.
machine Turing.
modèle algébrique.
complexité algorithme.
Isomorphismes (Mathématiques) > Informatique.
Complexité de calcul (Informatique) > Informatique.
Fundamentele informatica.
Complexiteit.
Berekenbaarheid.
Teoria Da Computacao.
Complexité de calcul (informatique)
Isomorphismes (mathématiques) > Informatique.
Electronic books.
Online Access:Connect to the full text of this electronic book
  • Holdings
  • Description
  • Similar Items
  • Staff View

Internet

Connect to the full text of this electronic book

Remote Storage

Holdings details from Remote Storage
Call Number: QA169 .T45 2000
 
Call Number Status Get It
QA169 .T45 2000 Available
  • howdy.tamu.edu
  • Off-Campus Access
  • Texas A&M University
  • Site Policies
  • Accessibility
  • Texas CREWS
  • Comments
  • Services Status
Loading...