P1042 Includes bibliographical references and indexes.
Buy a copy
OBNB doesn't sell books, but you may be able to find a copy at one of these websites:
Randomness and completeness in computational complexity by Dieter van Melkebeek. ISBN 3540414924. Published by Springer in 2000. Publication and catalogue information, links to buy online and reader comments.