Isbn: 9780817636807 - the graph isomorphism problem: its structural complexity (progress in theoretical computer science) (6 Ergebnisse)

Hardcover. Zustand: Good. No Jacket. Shelf and handling wear to cover and binding, with general signs of previous use. Wear commensurate with age and use. Former owner's name sticker pasted onto front inside board, otherwise clean and unmarked copy. Light bumping visible to corners of boards and ends of spine strip. Secure packaging for safe delivery.…

Zustand: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.…

Zustand: New. In English.

Zustand: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. Library sticker on front cover. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,450grams, ISBN:9780817636807.…

Zustand: New. 1993. Hardcover. . . . . . Books ship from the US and Ireland.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Recently, a variety ofresults on the complexitystatusofthegraph isomorphism problem has been obtained. These results belong to the so-called structural part of Complexity Theory. Our idea behind this book is to summarize such results which might otherwise not be easily accessible in the literature, and also, to give the reader an understanding of the aims and topics in Structural Complexity Theory, in general. The text is basically self contained; the only prerequisite for reading it is some elementary knowledge from Complexity Theory and Probability Theory. It can be used to teach a seminar or a monographic graduate course, but also parts of it (especially Chapter 1) provide a source of examples for a standard graduate course on Complexity Theory. Many people have helped us in different ways III the process of writing this book. Especially, we would like to thank V. Arvind, R.V. Book, E. May ordomo, and the referee who gave very constructive comments. This book project was especially made possible by a DAAD grant in the 'Acciones In tegrada' program. The third author has been supported by the ESPRIT project ALCOM-II.…