Feasible Mathematics: A Mathematical Sciences Institute Workshop, Ithaca, New York, June 1989: Progress in Computer Science and Applied Logic, cartea 9
Autor S.R. Buss, P.J. Scotten Limba Engleză Paperback – 1990
Din seria Progress in Computer Science and Applied Logic
- 20% Preț: 342.78 lei
- Preț: 380.25 lei
- 20% Preț: 333.54 lei
- 20% Preț: 1020.33 lei
- 15% Preț: 591.29 lei
- 20% Preț: 340.49 lei
- 20% Preț: 611.79 lei
- 20% Preț: 334.71 lei
- 20% Preț: 655.85 lei
- Preț: 387.75 lei
- 15% Preț: 588.04 lei
- 20% Preț: 586.71 lei
- 20% Preț: 474.87 lei
- Preț: 410.88 lei
- Preț: 393.74 lei
- Preț: 403.75 lei
- 15% Preț: 646.75 lei
- 15% Preț: 646.43 lei
- 20% Preț: 646.80 lei
- 20% Preț: 339.66 lei
- 15% Preț: 698.94 lei
- 15% Preț: 653.79 lei
- 18% Preț: 730.79 lei
- Preț: 399.29 lei
- 20% Preț: 420.91 lei
- 20% Preț: 335.03 lei
- Preț: 379.86 lei
- Preț: 381.00 lei
Preț: 334.86 lei
Preț vechi: 418.57 lei
-20% Nou
Puncte Express: 502
Preț estimativ în valută:
64.08€ • 66.50$ • 53.56£
64.08€ • 66.50$ • 53.56£
Carte tipărită la comandă
Livrare economică 17-31 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780817634834
ISBN-10: 0817634835
Pagini: 352
Ilustrații: VIII, 352 p.
Dimensiuni: 152 x 229 x 19 mm
Greutate: 0.49 kg
Ediția:1990
Editura: Birkhäuser Boston
Colecția Birkhäuser
Seria Progress in Computer Science and Applied Logic
Locul publicării:Boston, MA, United States
ISBN-10: 0817634835
Pagini: 352
Ilustrații: VIII, 352 p.
Dimensiuni: 152 x 229 x 19 mm
Greutate: 0.49 kg
Ediția:1990
Editura: Birkhäuser Boston
Colecția Birkhäuser
Seria Progress in Computer Science and Applied Logic
Locul publicării:Boston, MA, United States
Public țintă
ResearchCuprins
Parity and the Pigeonhole Principle.- Computing over the Reals (or an Arbitrary Ring) Abstract.- On Model Theory for Intuitionistic Bounded Arithmetic with Applications to Independence Results.- Sequential, Machine Independent Characterizations of the Parallel Complexity Classes AlogTIME, ACk NCk and NC.- Characterizations of the Basic Feasible Functionals of Finite Type.- Functional Interpretations of Feasibly Constructive Arithmetic — Abstract.- Polynomial-time Combinatorial Operators are Polynomials.- Isols and Kneser Graphs.- Stockmeyer Induction.- Probabilities of Sentences about Two Linear Orderings.- Bounded Linear Logic: a Modular Approach to Polynomial Time Computability, Extended Abstract.- On Finite Model Theory (Extended Abstract).- Computational Models for Feasible Real Analysis.- Inverting a One-to-One Real Function is Inherently Sequential.- On Bounded ?11 Polynomial Induction.- Subrecursion and Lambda Representation over Free Algebras (Preliminary Summary).- Complexity-Theoretic Algebra: Vector Space Bases.- When is every Recursive Linear Ordering of Type ? Recursively Isomorphic to a Polynomial Time Linear Ordering over the Natural Numbers in Binary Form?.