Imagen 1 de 6
Galería
Imagen 1 de 6
Feasible Computations & Provable Complexity Properties #30, CBMS-NSF 1978
USD49,77
Aproximadamente44,50 EUR
Estado:
“1978. Vintage / Collectable Computer Science. PBK. Feasible Computations and Provable Complexity ”... Más informaciónacerca del estado
En buen estado
Libro que se ha leído pero que está en buen estado. Daños mínimos en la tapa, incluidas rozaduras, pero sin roturas ni agujeros. Es posible que no incluya sobrecubierta para tapas duras. Tapa muy poco desgastada. La mayoría de las páginas están en buen estado con muy pocas arrugas o roturas. El texto subrayado a lápiz es prácticamente inexistente, no hay texto resaltado ni anotaciones en los márgenes. No faltan páginas. Consulta el anuncio del vendedor para obtener más información y la descripción de cualquier posible imperfección.
- ¡Cómpralo ya!Feasible Computations & Provable Complexity Properties #30, CBMS-NSF 1978
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Envío:
USD9,95 (aprox. 8,90 EUR) USPS Priority Mail®.
Ubicado en: Chapel Hill, North Carolina, Estados Unidos
Entrega:
Entrega prevista entre el vie. 16 may. y el mar. 20 may. a 43230
Devoluciones:
30 días para devoluciones. El comprador paga el envío de la devolución..
Pagos:
Compra con confianza
El vendedor asume toda la responsabilidad de este anuncio.
N.º de artículo de eBay:116324207757
Última actualización el 16 abr 2025 21:03:51 H.EspVer todas las actualizacionesVer todas las actualizaciones
Características del artículo
- Estado
- En buen estado
- Notas del vendedor
- Topic
- computer science, applied mathematics, vintage computer books
- Vintage
- Yes
- Genre
- Computer & IT, computer science, Mathematics
- Features
- formulas, 1978, Out of Print
- Personalized
- No
- Edition
- First Edition
- Intended Audience
- Adults
- Narrative Type
- Nonfiction
- Inscribed
- No
- Personalize
- No
- Ex Libris
- No
- Era
- 1970s
- Book Series
- Society for Industrial and Applied Mathematics
- Signed
- Yes
- Original Language
- English
- Book Title
- Feasible Computations and Provable Complexity Properties (CBMS-NS
- Signed By
- Previous Owner
- ISBN
- 9780898710274
Acerca de este producto
Product Identifiers
Publisher
Society for Industrial AND Applied Mathematics
ISBN-10
0898710278
ISBN-13
9780898710274
eBay Product ID (ePID)
740553
Product Key Features
Number of Pages
70 Pages
Publication Name
Feasible Computations and Provable Complexity Properties
Language
English
Publication Year
1987
Subject
Machine Theory, General, Linguistics / General
Type
Textbook
Subject Area
Computers, Language Arts & Disciplines
Series
Cbms-Nsf Regional Conference Series in Applied Mathematics Ser.
Format
Trade Paperback
Dimensions
Item Height
0.6 in
Item Weight
4.3 Oz
Item Length
9 in
Item Width
6 in
Additional Product Features
Intended Audience
Scholarly & Professional
Series Volume Number
No. 30
Table Of Content
Reductions and Complete Sets L-Isomorphisms of Complete Sets Structure of Complete Sets Long Proofs of Trivial Theorems What Can and Cannot Be Proven About Computational Complexity Relativized P NP Problem.
Synopsis
An overview of current developments in research on feasible computations; and a consideration of this area of research in relation to provable properties of complexity of computations. The author begins by defining and discussing efficient reductions between problems and considers the families and corresponding complete languages of NL, DCSL, CSL, P, NP, PTAPE, EXPTIME, and EXPTAPE. Definitions and results are uniformly extended to computationally simpler natural families of languages such as NL, P, and CSL by using Log n-tape bounded reductions. The problem of determining what can and cannot be formally proven about running times of algorithms is discussed and related to the problem of establishing sharp time bounds for one-tape Turing machine computations, and the inability to formally prove running times for algorithms is then related to the presence of gaps in the hierarchy of complexity classes. The concluding discussion is on the possibility that the famous P=NP? problem is independent of the axioms of formal mathematical systems such as set theory., Provides an overview of current developments in research on feasible computations; and a consideration of this area of research in relation to provable properties of complexity of computations.
Descripción del artículo del vendedor
Información de vendedor profesional
Acerca de este vendedor
PorterMonkeyBooks
100% de votos positivos•1,3 mil artículos vendidos
Registrado como vendedor profesional
Votos de vendedor (369)
- *****- Votos emitidos por el comprador.Últimos 6 mesesCompra verificadaWow....hard to find item, in perfect condition, sent quickly with excellent packaging and communication, for a very reasonable price. What's not to like!! Excellent seller. I recommend them without reservation. To the seller, thank you very much.
- g***- (33)- Votos emitidos por el comprador.Mes pasadoCompra verificadaWas replacing my wife’s water damaged Bible: this was the exact one! Fair price, perfect condition/as described, fast shipping, well packaged… no complaints. Thank you!
- m***r (376)- Votos emitidos por el comprador.Mes pasadoCompra verificadaAccurate description great packaging fast shipping, thanks!
PorterMonkeyBooks
100% de votos positivos•1,3 mil artículos vendidos
Registrado como vendedor profesional
Votos de vendedor (369)
- *****- Votos emitidos por el comprador.Últimos 6 mesesCompra verificadaWow....hard to find item, in perfect condition, sent quickly with excellent packaging and communication, for a very reasonable price. What's not to like!! Excellent seller. I recommend them without reservation. To the seller, thank you very much.
- g***- (33)- Votos emitidos por el comprador.Mes pasadoCompra verificadaWas replacing my wife’s water damaged Bible: this was the exact one! Fair price, perfect condition/as described, fast shipping, well packaged… no complaints. Thank you!
- m***r (376)- Votos emitidos por el comprador.Mes pasadoCompra verificadaAccurate description great packaging fast shipping, thanks!