机读格式显示(MARC)
- 000 02027oam2 2200313 450
- 010 __ |a 978-7-03-018299-9 |b 精装 |d CNY98.00
- 100 __ |a 20070616e2007 em y0chiy0121 ea
- 200 1_ |a 代数复杂性理论 |A dai shu fu za xing li lun |d = Algebraic Complexity Theory |f (瑞士) 比尔吉斯尔(Burgisser,P.) ... [等] 著 |z eng
- 210 __ |a 北京 |c 科学出版社 |d 2007
- 225 2_ |a 国外数学名著系列 |A guo wai shu xue ming zhu xi lie |v 25
- 300 __ |a 中国科学院科学出版基金资助出版
- 305 __ |a 本书英文影印版由德国施普林格出版公司授权出版
- 330 __ |a In this book we focus on Algebraic Complexity Theory, the study of the intrinsic algorithmic difficulty of algebraic problems within an algebraic model of computation. Motivated by questions of numerical and symbolic computation, this branch of research originated in 1954 when Ostrowski [403] inquired about the optimality of Homer's rule. Algebraic complexity theory grew rapidly and has since become a well-established area of research. However, with the exception of the now classic monograph by Borodin and Munro, published in 1975, a systematic treatment of this theory is not available. .This book is intended to be a comprehensive text which presents both traditional material and recent research in algebraic complexity theory in a coherent way. Requiring only some basic algebra and offering over 350 exercises, it should be well-suited as a textbook for beginners at the graduate level. With its extensive bibliographic notes covering nearly 600 research papers, it might also serve as a reference book. ...
- 410 _0 |1 2001 |a 国外数学名著系列 |v 25
- 510 1_ |a Algebraic Complexity Theory |z eng
- 606 0_ |a 代数 |A dai shu |x 复杂性理论 |x 英文
- 701 _0 |a 比尔吉斯尔 |A bi er ji si er |4 著
- 801 _0 |a CN |b JDZXYTSG |c 20090815
- 905 __ |a JDZXY |d O15/12