Cyclic Homology
Second Edition.
Our rough guess is there are 129,000 words in this book.
At a pace averaging 250 words per minute, this book will take 8 hours and 36 minutes to read. With a half hour per day, this will take 17 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Author
Publication
1998 - Springer Berlin Heidelberg, Berlin, Heidelberg, Germany
Language
English
Word Count
129,000 words, Guess
Page Count
516 pages
Physical Format
[electronic resource] /
Identifiers
- Open LibraryOL27028604M
- ISBN-139783642083167
- ISBN-103642083161
- OCLC Control Number851383800
- OCLC Control Numbercyclichomology00loda
Classifications
- DDC514.2
- LCCQA612-612.8
Description
From the reviews: "This is a very interesting book containing material for a comprehensive study of the cyclid homological theory of algebras, cyclic sets and S1-spaces. Lie algebras and algebraic K-theory and an introduction to Connes'work and recent results on the Novikov conjecture. The book requires a knowledge of homological algebra and Lie algebra theory as well as basic technics coming from algebraic topology. The bibliographic comments at the end of each chapter offer good suggestions for further reading and research. The book can be strongly recommended to anybody interested in noncommutative geometry, contemporary algebraic topology and related topics." European Mathematical Society Newsletter In this second edition the authors have added a chapter 13 on MacLane (co)homology.
Subjects
Series Statement
- Grundlehren der mathematischen Wissenschaften, A Series of Comprehensive Studies in Mathematics -- 301
Other Editions
- Cyclic Homology
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!