Logic and Computational Complexity: International Workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994. Selected Papers: Lecture Notes in Computer Science, cartea 960
Editat de Daniel Leivanten Limba Engleză Paperback – 2 aug 1995
The synergy between logic and computational complexity has gained importance and vigor in recent years, cutting across many areas. The 25 revised full papers in this book contributed by internationally outstanding researchers document the state-of-the-art in this interdisciplinary field of growing interest; they are presented in sections on foundational issues, applicative and proof-theoretic complexity, complexity of proofs, computational complexity of functionals, complexity and model theory, and finite model theory.
Din seria Lecture Notes in Computer Science
- 20% Preț: 1040.03 lei
- 20% Preț: 333.46 lei
- 20% Preț: 335.08 lei
- 20% Preț: 444.17 lei
- 20% Preț: 238.01 lei
- 20% Preț: 333.46 lei
- 20% Preț: 438.69 lei
- Preț: 440.52 lei
- 20% Preț: 336.71 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 567.60 lei
- 20% Preț: 571.63 lei
- 15% Preț: 568.74 lei
- 17% Preț: 427.22 lei
- 20% Preț: 641.78 lei
- 20% Preț: 307.71 lei
- 20% Preț: 574.05 lei
- 20% Preț: 579.56 lei
- Preț: 373.56 lei
- 20% Preț: 330.23 lei
- 20% Preț: 649.49 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- 20% Preț: 1386.07 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1003.66 lei
- 20% Preț: 256.27 lei
- 20% Preț: 632.22 lei
- 20% Preț: 575.48 lei
- 20% Preț: 747.79 lei
- 20% Preț: 1053.45 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 346.40 lei
- 20% Preț: 809.19 lei
- Preț: 402.62 lei
- 20% Preț: 584.40 lei
- 20% Preț: 1159.14 lei
- 20% Preț: 747.79 lei
- Preț: 389.48 lei
- 20% Preț: 343.16 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 336.85 lei
Preț vechi: 421.06 lei
-20% Nou
Puncte Express: 505
Preț estimativ în valută:
64.47€ • 66.96$ • 53.55£
64.47€ • 66.96$ • 53.55£
Carte tipărită la comandă
Livrare economică 01-15 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540601784
ISBN-10: 3540601783
Pagini: 528
Ilustrații: VIII, 520 p.
Dimensiuni: 155 x 235 x 28 mm
Greutate: 0.73 kg
Ediția:1995
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540601783
Pagini: 528
Ilustrații: VIII, 520 p.
Dimensiuni: 155 x 235 x 28 mm
Greutate: 0.73 kg
Ediția:1995
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Strict finitism and feasibility.- Logical omniscience.- On feasible numbers.- On parallel hierarchies and R k i .- Program extraction from classical proofs.- Computation models and function algebras.- Expressing computational complexity in constructive type theory.- Light linear logic.- Intrinsic theories and computational complexity.- On Herbrand's theorem.- Some consequences of cryptographical conjectures for S 2 1 and EF.- Frege proof system and TNC°.- Characterizing parallel time by type 2 recursions with polynomial output length.- Type 2 polynomial hierarchies.- The hierarchy of terminating recursive programs over N.- Feasibly categorical models.- Metafinite model theory.- Automatic presentations of structures.- A restricted second order logic for finite structures.- Comparing the power of monadic NP games.- Linear constraint query languages expressive power and complexity.- A constant-space sequential model of computation for first-order logic.- Logics capturing relativized complexity classes uniformly.- Preservation theorems in finite model theory.- A query language for NC (extended abstract).