【预售 按需印刷】Computational Complexity计算复杂度：现代视野 北京直发，付款后10日内发货
¥533.00
【预订】Computational Complexity of Solving Equation Systems 978 美国库房发货，通常付款后3-5周到货！
Product Details 基本信息 ISBN-13 书号 9783319217499 Author 作者 Broniek Format 版本 平装-胶订 Pages Number 页数 64页 Publisher 出版社 Springer International Publishing Publication Date 出版日期 2015-08-05 Product Dimensions 商品尺寸 9.2 x 6.1 x 0.1 cm Shipping Weight 商品重量 134g Language 语种 英语 Book Contents 内容简介 This volume considers the computational complexity of determining whether a system of equations over a fixed algebra A has a solution. It examines in detail the two problems this leads to: SysTermSat(A) and SysPolSat(A), in which equations are built out of terms or polynomials, respectively. The book characterizes those algebras for which SysPolSat can be solved in a polynomial time. So far, studies and their outcomes have not covered algebras that generate a variety admitting type 1 in the sense of Tame Congruence Theory. Since unary algebras admit only type 1, thi
¥608.00
【预订】Computational Complexity Y9781402003134 美国库房发货，通常付款后3-5周到货！
¥1217
【预订】Computational Complexity and Statistical Physics Y978019 美国库房发货，通常付款后3-5周到货！
¥783.00
Computational Complexity 计算复杂性 Sanjeev Arora 精装
¥709.00
【预订】Computational Complexity of Counting and Sampling 978113 美国库房发货，通常付款后3-5周到货！
Product Details 基本信息 ISBN-13 书号 9781138035577 Author 作者 Istvan Miklos Format 版本 平装-胶订 Pages Number 页数 378页 Publication Date 出版日期 2018-12-18 Language 语种 英语 Book Contents 内容简介 Computational Complexity of Counting and Sampling provides readers with comprehensive and detailed coverage of the subject of computational complexity. It is primarily geared for researchers in enumerative combinatorics, discrete mathematics and theoretical computer science. The book covers three topics: Counting problems that are solvable in polynomial running time; Approximation of algorithms for counting and sampling; Holographic algorithms.First, it opens with the basics such as the algorithmic point of view, dynamic programming algorithms and theoretical computer science point of view. Later, the book expands its scope to focus on advanced topics like stochastic approximations of counting computational objec
¥1016
【预订】Computational Complexity and Statistical Physics Y978019 美国库房发货，通常付款后3-5周到货！
¥2239
【预订】Computational Complexity of Counting and Sampling 978113 美国库房发货，通常付款后3-5周到货！
Product Details 基本信息 ISBN-13 书号 9781138070837 Author 作者 Istvan Miklos Format 版本 精装 Pages Number 页数 378页 Publication Date 出版日期 2018-12-18 Language 语种 英语 Book Contents 内容简介 Computational Complexity of Counting and Sampling provides readers with comprehensive and detailed coverage of the subject of computational complexity. It is primarily geared for researchers in enumerative combinatorics, discrete mathematics and theoretical computer science. The book covers three topics: Counting problems that are solvable in polynomial running time; Approximation of algorithms for counting and sampling; Holographic algorithms.First, it opens with the basics such as the algorithmic point of view, dynamic programming algorithms and theoretical computer science point of view. Later, the book expands its scope to focus on advanced topics like stochastic approximations of counting computational objects and
¥3013
【预订】Computational Complexity: A Quantitative 美国库房发货，通常付款后3-5周到货！
¥2125
【预订】Computational Complexity and Property Testing 9783030436 美国库房发货，通常付款后3-5周到货！
Product Details 基本信息 ISBN-13 书号 9783030436612 Author 作者 Benjamini Itai(Contribution by) Format 版本 平装-胶订 Pages Number 页数 382页 Publisher 出版社 Springer Berlin Heidelberg Publication Date 出版日期 2020-04-04 Product Dimensions 商品尺寸 9.2 x 6.1 x 0.8 cm Shipping Weight 商品重量 1210g Language 语种 英语 Book Contents 内容简介 This volume contains a collection of studies in the areas of complexity theory and property testing. The 21 pieces of scientific work included were conducted at different times, mostly during the last decade. Although most of these works have been cited in the literature, none of them was formally published before. Within complexity theory the topics include constant-depth Boolean circuits, explicit construction of expander graphs, interactive proof systems, monotone formulae for majority, probabilistically checkable proofs (PCPs), pseudorandomne
¥974.00
Computational Complexity: A Modern Approach
Product Details 基本信息 ISBN-13 书号 9780521424264 Author 作者 Sanjeev Arora,Boaz Barak Format 版本 精装 Pages Number 页数 594页 Publisher 出版社 Cambridge University Press Publication Date 出版日期 2009年5月1日 Product Dimensions 商品尺寸 21.5 x 3.5 x 25.3 cm Shipping Weight 商品重量 1.2 Kg Language 语种 英语 Book Description 内容简介 This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory. Requiring essentially no background apart from mathematical maturity, the book can be used as a reference for self-study for anyone interested in complexity, including physicists, mathematicians, and other scientists, as well as a textbook for a variety of courses and seminars. More than 300 exercises are included with a selected hint set. The book starts with a b
¥502.00
【预订】Computational Complexity and Feasibility of Data 美国库房发货，通常付款后3-5周到货！
¥2434
【预订】Computational Complexity of Bilinear Forms: Algebraic Co 美国库房发货，通常付款后3-5周到货！
¥608.00
【预订】Computational Complexity and Feasibility of Data Process 美国库房发货，通常付款后3-5周到货！
¥2434
【预订】Computational Complexity 9781461417996 美国库房发货，通常付款后3-5周到货！
¥15818
预订Computational Complexity of SAT, Xsat and Nae-SAT 预订，预计下单后2-3周左右发货！
¥1338
按需印刷CBG Computational Complexity 预订，预计下单后3-4周左右发货！
¥626.00
3-6周达 Computational Complexity and Property Testing: On the 【全球购】进口原版图书，预计3-6周左右到国内
¥794.00
预订 Computational Complexity [ISBN:9780201530827] 【全球购】进口原版图书，一般5-8周左右到国内
¥1880
预订 Computational Complexity and Statistical Physics [ISBN:97 【全球购】进口原版图书，约3-6周到达国内后发出
¥2002
海外直订Computational Complexity and Property Testing: On the In
¥824.00
预订 Computational Complexity of Counting and Sampling [ISBN:9 【全球购】进口原版图书，一般5-8周左右到国内
¥813.00
预订 Computational Complexity and Statistical Physics [ISBN:97 【全球购】进口原版图书，约3-6周到达国内后发出
¥718.00
海外直订Computational Complexity: A Quantitative Perspective 计算复
¥2773
【预订】The Computational Complexity of Equivalence and Isomorph 国外库房发货，通常付款后3-5周到货！
Product Details 基本信息 ISBN-13 书号 9783540410324 Author 作者 Thierauf Format 版本 平装-胶订 Pages Number 页数 135页 Publisher 出版社 Springer Berlin Heidelberg Publication Date 出版日期 2000-08-04 Language 语种 英语 Book Contents 内容简介 A computational model is a framework for doing computations according to certain specified rules on some input data. These models come for example from automata theory, formal language theory, logic, or circuit theory. The computational power of such a model can be judged by evaluating certain problems with respect to that model.The theory of computations is the study of the inherent difficulty of computational problems, that is, their computational complexity. This monograph analyzes the computational complexity of the satisfiability, equivalence, and almost-equivalence problems with respect to various computational models. In particular, Boolean formulas, circuits
¥608.00
【3-6周达】Computational Complexity: Theory, Techniques, and App 【全球购】进口原版图书，预计3-6周左右到国内
¥13097
预订 Computational Complexity [ISBN:9781402003134] 【全球购】进口原版图书，一般5-8周左右到国内
¥1278
【预订】The Computational Complexity of Differential and Integra 国外库房发货，通常付款后3-5周到货！
Product Details 基本信息 ISBN-13 书号 9780198535898 Author 作者 Werschulz Format 版本 精装 Pages Number 页数 342页 Publisher 出版社 Oxford University Press Publication Date 出版日期 1991-08-29 Shipping Weight 商品重量 702g Language 语种 英语 Book Contents 内容简介 This book is concerned with a central question in numerical analysis: how efficient can algorithms be made given only incomplete information about a differential or integral equation Typically this question might arise when an equation is of the form Lu = f, where f is some function defined on a domain and L is a differential operator. We may not be given f exactly, merely its value at a finite number of points in the domain. Consequently the best that can be hoped for is to solve the equation to within a given accuracy at minimal cost or complexity. The author develops the theory of the complexity of the solution to differential and i
¥686.00
按需印刷Computational Complexity of Counting and Sampling 预订，预计下单后2-3周左右发货！
¥2520
海外直订Computational Complexity and Feasibility of Data Process
¥2067
【3-6周达】Computational Complexity of Solving Equation Systems 【全球购】进口原版图书，预计3-6周左右到国内
¥507.00
预订 Computational Complexity and Local Algorithms: On the Int 国外库房发货，通常付款后3-5周到货
¥900.00
预订 Computational Complexity: Theory, Techniques, and Applica 【全球购】进口原版图书，一般5-8周左右到达国内后发出
¥18988
预订 Computational Complexity: A Quantitative Perspective [ISB 【全球购】进口原版图书，一般5-8周左右到国内后发出
¥1817
海外直订Computational Complexity of Differential and Integral Eq
¥774.00
3-6周达 Computational Complexity [ISBN:9780521424264] 【全球购】进口原版图书，一般3-6周左右到国内后发出
¥673.00
预订 Computational Complexity of Counting and Sampling [ISBN:9 【全球购】进口原版图书，一般5-8周左右到国内
¥2516
海外直订Computational Complexity and Feasibility of Data Process
¥2067
预订 Computational Complexity and Feasibility of Data Processi 【全球购】进口原版图书，约3-6周到达国内后发出
¥2077
3-6周达 Computational Complexity: A Conceptual Perspective [IS 【全球购】进口原版图书，一般3-6周左右到国内后发出
¥869.00
按需印刷Computational Complexity of Counting and Sampling 预订，预计下单后3-4周左右发货！
¥1071
英文原版 Computational Complexity 计算复杂性 Sanjeev Arora 精装 英文版 进口英
¥709.00
英文原版 Computational Complexity 计算复杂性 Oded Goldreich 精装 英文版 进口
¥960.00
预订 The Computational Complexity of Differential and Integral 【全球购】进口原版图书，约3-6周到达国内后发出
¥610.00
【预售 按需印刷】Computational Complexity of SAT, Xsat and
¥1312.4
预售 按需印刷 Computational Complexity of Counting and S 北京发货，付款后10天内发货
¥2335
【预售 按需印刷】Theory of Computational Complexity
¥854.25
【预订】Theory of Computational Complexity 美国库房发货，通常付款后3-5周到货！
¥1829
预订 The Computational Complexity of Equivalence and Isomorphi 【全球购】进口原版图书，约3-6周到达国内后发出
¥626.00
海外直订The Computational Complexity of Equivalence and Isomorph
¥553.00
预售 英文预定 Computational Complexity 海外预定商品预计1-3个月发货，海外购非质量问题不接受退货。
¥1057.09
【预订】Perspectives in Computational Complexity: The Somenath B 美国库房发货，通常付款后3-5周到货！
¥1339
【中商原版】计算复杂性的现代方法 英文原版 Computational Complexity A Modern Appr
¥731.00
【预订】Recursion Theory and Computational Complexity 9783642110 美国库房发货，通常付款后3-5周到货！
Product Details 基本信息 ISBN-13 书号 9783642110719 Author 作者 Lolli Format 版本 平装-胶订 Pages Number 页数 236页 Publication Date 出版日期 2010-11-30 Shipping Weight 商品重量 760g Language 语种 英语 Book Contents 内容简介 S. Homer: Admissible recursion theory.- B.E. Jacobs: Computational complexity and recursion theory.- D. Normann: A survey of set recursion.- G.E. Sacks: Priority arguments in Higgler recursion.- R.I. Soare: Construction in the recursively enumerable degrees.- W. Maass: Recursively invariant recursion theory.
¥425.00
【中商原版】计算复杂性 概念视角 Computational Complexity A Conceptual Persp
¥880.00
海外直订Logic and Computational Complexity: International Worksh
¥549.00
预订 Advances in Computational Complexity Theory: Workshop on 国外库房发货，通常付款后3-5周到货
¥1366
3-6周达 Perspectives in Computational Complexity: The Somenath 【全球购】进口原版图书，一般3-6周左右到国内后发出
¥1111
【预订】Logic, Automata, and Computational Complexity 9798400707 国外库房发货，通常付款后3-5周到货！
Product Details 基本信息 ISBN-13 书号 9798400707797 Author 作者 Bruce M. Kapron Format 版本 精装 Pages Number 页数 426页 Publisher 出版社 Morgan & Claypool Publishers Publication Date 出版日期 2023-05-22 Language 语种 其它（含多语）
¥778.00
海外直订Perspectives in Computational Complexity: The Somenath B
¥1137
