|
|
|
|
| LEADER |
00000cam a2200000 i 4500 |
| 001 |
SCIDIR_ocn564875304 |
| 003 |
OCoLC |
| 005 |
20231117032938.0 |
| 006 |
m o d |
| 007 |
cr bn||||||abp |
| 007 |
cr bn||||||ada |
| 008 |
100321s1976 nyu ob 101 0 eng d |
| 040 |
|
|
|a OCLCE
|b eng
|e pn
|c OCLCE
|d OCLCQ
|d OCLCO
|d OCLCQ
|d OCLCF
|d OPELS
|d IDEBK
|d E7B
|d OCL
|d OCLCO
|d OCLCA
|d OCLCQ
|d UKAHL
|d VLY
|d LUN
|d OCLCQ
|d OCLCA
|d OCLCO
|d INARC
|d OCLCQ
|d OCLCO
|d COM
|d OCLCO
|d OCLCQ
|d OCLCO
|
| 019 |
|
|
|a 649522259
|a 987390896
|a 1100869364
|a 1162221247
|a 1237937287
|a 1244232404
|a 1397701386
|
| 020 |
|
|
|a 9780126975604
|q (electronic bk.)
|
| 020 |
|
|
|a 0126975604
|q (electronic bk.)
|
| 020 |
|
|
|a 9781483257891
|q (e-book)
|
| 020 |
|
|
|a 1483257894
|
| 035 |
|
|
|a (OCoLC)564875304
|z (OCoLC)649522259
|z (OCoLC)987390896
|z (OCoLC)1100869364
|z (OCoLC)1162221247
|z (OCoLC)1237937287
|z (OCoLC)1244232404
|z (OCoLC)1397701386
|
| 042 |
|
|
|a dlr
|
| 050 |
|
4 |
|a QA297
|b .S915 1975
|
| 082 |
0 |
4 |
|a 519.4
|2 18
|
| 084 |
|
|
|a 31.76
|2 bcl
|
| 084 |
|
|
|a 54.10
|2 bcl
|
| 111 |
2 |
|
|a Symposium on Analytic Computational Complexity
|d (1975 :
|c Carnegie Mellon University)
|
| 245 |
1 |
0 |
|a Analytic computational complexity /
|c edited by J.F. Traub.
|
| 260 |
|
|
|a New York :
|b Academic Press,
|c 1976.
|
| 300 |
|
|
|a 1 online resource (ix, 239 pages)
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a "Proceedings of the Symposium on Analytic Computational Complexity, held by the Computer Science Department, Carnegie-Mellon University, Pittsburgh, Pennsylvania, on April 7-8, 1975."
|
| 504 |
|
|
|a Includes bibliographical references and index.
|
| 506 |
|
|
|3 Use copy
|f Restrictions unspecified
|2 star
|5 MiAaHDL
|
| 533 |
|
|
|a Electronic reproduction.
|b [Place of publication not identified] :
|c HathiTrust Digital Library,
|d 2010.
|5 MiAaHDL
|
| 538 |
|
|
|a Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.
|u http://purl.oclc.org/DLF/benchrepro0212
|5 MiAaHDL
|
| 583 |
1 |
|
|a digitized
|c 2010
|h HathiTrust Digital Library
|l committed to preserve
|2 pda
|5 MiAaHDL
|
| 588 |
0 |
|
|a Print version record.
|
| 505 |
0 |
|
|a Front Cover; AnalyticComputational Complexity; Copyright Page; Table of Contents; LIST OF INVITED AUTHORS; PREFACE; CHAPTER 1. INTRODUCTION; CHAPTER 2. SOME REMARKS ON PROOF TECHNIQUES IN ANALYTIC COMPLEXITY; References; CHAPTER 3. STRICT L�OWER AND UPPER BOUNDS ON ITERATIVE COMPUTATIONAL COMPLEXITY; 1. INTRODUCTION; 2. BASIC CONCEPTS; 3. BOUNDS ON THE ERROR COEFFICIENT FUNCTION; 4. THE VARIABLE ERROR COEFFICIENT MODEL; 5. BOUNDS ON THE COMPLEXITY INDEX; 6. SUMMARY AND EXTENS IONS TO THE MODEL; ACKNOWLEDCMNT; REFERENCES
|
| 505 |
8 |
|
|a CHAPTER 4. THE COMPLEXITY OF OBTAINING STARTING POINTS FOR SOLVING OPERATOR EQUATIONS BY NEWTON'S METHOD1. INTRODUCTION; 2. METHODOLOGY AND A USEFUL LEMMA FOR PROVING LOWER BOUNDS; 3. SOME RESULTS ON REAL VALUED FUNCTIONS OF ONE VARIABLE; 4. A PROCEDURE TO OBTAIN GOOD STARTING POINTS FOR NEWTON'SMETHOD; 5. SUMMARY AND CONCLUSIONS; ACKNOWLEDGMENTS; REFERENCES; CHAPTER 5.A CLASS OF OPTIMAL-ORDER ZERO-FINDING METHODS USING DERIVATIVE EVALUATIONS; 1. INTRODUCTION; 2. MOTIVATION; 3. A SIXTH-ORDER METHOD; 4. METHODS OF ORDER 2v; 5. RELATED NONLINEAR RUNGE-KUTTA METHODS; 6. SOME NUMERICAL RESULTS
|
| 505 |
8 |
|
|a CHAPTER 8. THE USE OF INTEGRALS IN THE SOLUTION OF NONLINEAR EQUATIONS IN N DIMENSIONS1. INTRODUCTION; 2. AN INTERPOLATORY-INTEGRAL ITERATION I_ 1,s; 3. ORDER OF THE INTEGRAL INFORMATION; 4. COMPLEXITY INDEX; 5. INTEGRAL INFORMATION WITH KERNELS; ACKNOWLEDGMENT; 6. REFERENCES; Chapter 9. Complexity and Differential Equations; 1. INTRODUCTION; 2. GENERALIZED INTERPOLATION PROBLEMS; 3. SPARSE LINEAR SYSTEMS; 4. SPARSE NONLINEAR SYSTEMS; REFERENCES; CHAPTER 10. MULTIPLE-PRECISION ZERO-FINDING METHODS AND THE COMPLEXITY OF ELEMENTARY FUNCTION EVALUATION; 1. INTRODUCTION
|
| 546 |
|
|
|a English.
|
| 650 |
|
0 |
|a Numerical analysis
|x Data processing
|v Congresses.
|
| 650 |
|
0 |
|a Computational complexity
|v Congresses.
|
| 650 |
|
0 |
|a Numerical analysis
|x Data processing
|x Congresses.
|
| 650 |
|
6 |
|a Analyse num�erique
|0 (CaQQLa)201-0021900
|x Informatique
|0 (CaQQLa)201-0380011
|x Congr�es.
|0 (CaQQLa)201-0378208
|
| 650 |
|
6 |
|a Complexit�e de calcul (Informatique)
|0 (CaQQLa)201-0068287
|v Congr�es.
|0 (CaQQLa)201-0378219
|
| 650 |
|
6 |
|a Analyse num�erique
|0 (CaQQLa)201-0021900
|x Informatique
|0 (CaQQLa)201-0380011
|v Congr�es.
|0 (CaQQLa)201-0378219
|
| 650 |
|
7 |
|a Computational complexity
|2 fast
|0 (OCoLC)fst00871991
|
| 650 |
|
7 |
|a Numerical analysis
|x Data processing
|2 fast
|0 (OCoLC)fst01041279
|
| 650 |
1 |
7 |
|a Complexiteit.
|2 gtt
|
| 650 |
|
7 |
|a Teoria Da Computacao.
|2 larpcal
|
| 655 |
|
2 |
|a Congress
|0 (DNLM)D016423
|
| 655 |
|
7 |
|a proceedings (reports)
|2 aat
|0 (CStmoGRI)aatgf300027316
|
| 655 |
|
7 |
|a Conference papers and proceedings
|2 fast
|0 (OCoLC)fst01423772
|
| 655 |
|
7 |
|a Conference papers and proceedings.
|2 lcgft
|
| 655 |
|
7 |
|a Actes de congr�es.
|2 rvmgf
|0 (CaQQLa)RVMGF-000001049
|
| 700 |
1 |
|
|a Traub, J. F.
|q (Joseph Frederick),
|d 1932-2015.
|
| 710 |
2 |
|
|a Carnegie Mellon University.
|b Computer Science Department.
|
| 776 |
0 |
8 |
|i Print version:
|a Symposium on Analytic Computational Complexity (1975 : Carnegie-Mellon University).
|t Analytic computational complexity.
|d New York : Academic Press, 1976
|w (DLC) 75013086
|w (OCoLC)2073884
|
| 856 |
4 |
0 |
|u https://sciencedirect.uam.elogim.com/science/book/9780126975604
|z Texto completo
|
