Completeness and Reduction in Algebraic Complexity Theory (Algorithms and Computation in Mathematics)

1 edition
  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read
Not in Library

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read

Buy this book

Last edited by MARC Bot
July 28, 2020 | History

Completeness and Reduction in Algebraic Complexity Theory (Algorithms and Computation in Mathematics)

1 edition
  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read

This edition doesn't have a description yet. Can you add one?

Publish Date
Publisher
Springer
Language
English
Pages
168

Buy this book

Edition Availability
Cover of: Completeness and Reduction in Algebraic Complexity Theory (Algorithms and Computation in Mathematics)
Completeness and Reduction in Algebraic Complexity Theory (Algorithms and Computation in Mathematics)
July 26, 2000, Springer
Hardcover in English - 1 edition

Add another edition?

Book Details


First Sentence

"Computational complexity theory provides a framework for understanding the cost required to solve algorithmic problems."

Classifications

Library of Congress
QA267.7 .B88 2000, QA1-939

The Physical Object

Format
Hardcover
Number of pages
168
Dimensions
9.4 x 6.3 x 0.8 inches
Weight
1 pounds

ID Numbers

Open Library
OL9063174M
ISBN 10
3540667520
ISBN 13
9783540667520
LCCN
00029647
OCLC/WorldCat
43648697
Library Thing
8099322
Goodreads
5751205

Community Reviews (0)

Feedback?
No community reviews have been submitted for this work.

History

Download catalog record: RDF / JSON
July 28, 2020 Edited by MARC Bot import existing book
April 28, 2010 Edited by Open Library Bot Linked existing covers to the work.
December 10, 2009 Created by WorkBot add works page