? DoesP=NP. In just ?ve symbols Dick Karp -in 1972-captured one of the deepest and most important questions of all time. When he ?rst wrote his famous paper, I think it's fair to say he did not know the depth and importance of his question. Now over three decades later, we know P=NP is central to our understanding of compu- tion, it is a very hard problem, and its resolution will have potentially tremendous consequences. This book is a collection of some of the most popular posts from my blog- Godel ] Lost Letter andP=NP-which I started in early 2009. The main thrust of the blog, especially when I started, was to explore various aspects of computational complexity around the famousP=NP question. As I published posts I branched out and covered additional material, sometimes a timely event, sometimes a fun idea, sometimes a new result, and sometimes an old result. I have always tried to make the posts readable by a wide audience, and I believe I have succeeded in doing this."

In February 1992, I defended my doctoral thesis: Engineering Optimiza tion - selected contributions (IMSOR, The Technical University of Den mark, 1992, p. 92). This dissertation presents retrospectively my central contributions to the theoretical and applied aspects of optimization. When I had finished my thesis I became interested in editing a volume related to a new expanding area of applied optimization. I considered several approaches: simulated annealing, tabu search, genetic algorithms, neural networks, heuristics, expert systems, generalized multipliers, etc. Finally, I decided to edit a volume related to simulated annealing. My main three reasons for this choice were the following: (i) During the last four years my colleagues at IMSOR and I have car ried out several applied projects where simulated annealing was an essential. element in the problem-solving process. Most of the avail able reports and papers have been written in Danish. After a short review I was convinced that most of these works deserved to be pub lished for a wider audience. (ii) After the first reported applications of simulated annealing (1983- 1985), a tremendous amount of theoretical and applied work have been published within many different disciplines. Thus, I believe that simulated annealing is an approach that deserves to be in the curricula of, e.g. Engineering, Physics, Operations Research, Math ematical Programming, Economics, System Sciences, etc. (iii) A contact to an international network of well-known researchers showed that several individuals were willing to contribute to such a volume."

The book incorporates research papers and surveys written by participants ofan International Scientific Programme on Approximation Theory jointly supervised by Institute for Constructive Mathematics of University of South Florida at Tampa, USA and the Euler International Mathematical Instituteat St. Petersburg, Russia. The aim of the Programme was to present new developments in Constructive Approximation Theory. The topics of the papers are: asymptotic behaviour of orthogonal polynomials, rational approximation of classical functions, quadrature formulas, theory of n-widths, nonlinear approximation in Hardy algebras, numerical results on best polynomial approximations, wavelet analysis. FROM THE CONTENTS: E.A. Rakhmanov: Strong asymptotics for orthogonal polynomials associated with exponential weights on R.- A.L. Levin, E.B. Saff: Exact Convergence Rates for Best Lp Rational Approximation to the Signum Function and for Optimal Quadrature in Hp.- H. Stahl: Uniform Rational Approximation of x .- M. Rahman, S.K. Suslov: Classical Biorthogonal Rational Functions.- V.P. Havin, A. Presa Sague: Approximation properties of harmonic vector fields and differential forms.- O.G. Parfenov: Extremal problems for Blaschke products and N-widths.- A.J. Carpenter, R.S. Varga: Some Numerical Results on Best Uniform Polynomial Approximation of x on 0,1 .- J.S. Geronimo: Polynomials Orthogonal on the Unit Circle with Random Recurrence Coefficients.- S. Khrushchev: Parameters of orthogonal polynomials.- V.N. Temlyakov: The universality of the Fibonacci cubature formulas.

This volume contains the proceedings of the fifth International Workshop on Distributed Algorithms (WDAG '91) held in Delphi, Greece, in October 1991. The workshop provided a forum for researchers and others interested in distributed algorithms, communication networks, and decentralized systems. The aim was to present recent research results, explore directions for future research, and identify common fundamental techniques that serve as building blocks in many distributed algorithms. The volume contains 23 papers selected by the Program Committee from about fifty extended abstracts on the basis of perceived originality and quality and on thematic appropriateness and topical balance. The workshop was organizedby the Computer Technology Institute of Patras University, Greece.

Using data from one season of NBA games, Basketball Data Science: With Applications in R is the perfect book for anyone interested in learning and applying data analytics in basketball. Whether assessing the spatial performance of an NBA player's shots or doing an analysis of the impact of high pressure game situations on the probability of scoring, this book discusses a variety of case studies and hands-on examples using a custom R package. The codes are supplied so readers can reproduce the analyses themselves or create their own. Assuming a basic statistical knowledge, Basketball Data Science with R is suitable for students, technicians, coaches, data analysts and applied researchers. Features: * One of the first books to provide statistical and data mining methods for the growing field of analytics in basketball. * Presents tools for modelling graphs and figures to visualize the data. * Includes real world case studies and examples, such as estimations of scoring probability using the Golden State Warriors as a test case. * Provides the source code and data so readers can do their own analyses on NBA teams and players.

The papers in this volume were presented at the fourth biennial Summer Conference on Category Theory and Computer Science, held in Paris, September3-6, 1991. Category theory continues to be an important tool in foundationalstudies in computer science. It has been widely applied by logicians to get concise interpretations of many logical concepts. Links between logic and computer science have been developed now for over twenty years, notably via the Curry-Howard isomorphism which identifies programs with proofs and types with propositions. The triangle category theory - logic - programming presents a rich world of interconnections. Topics covered in this volume include the following. Type theory: stratification of types and propositions can be discussed in a categorical setting. Domain theory: synthetic domain theory develops domain theory internally in the constructive universe of the effective topos. Linear logic: the reconstruction of logic based on propositions as resources leads to alternatives to traditional syntaxes. The proceedings of the previous three category theory conferences appear as Lecture Notes in Computer Science Volumes 240, 283 and 389.

M. Andreatta, E.Ballico, J.Wisniewski: Projective manifolds containing large linear subspaces; - F.Bardelli: Algebraic cohomology classes on some specialthreefolds; - Ch.Birkenhake, H.Lange: Norm-endomorphisms of abelian subvarieties; - C.Ciliberto, G.van der Geer: On the jacobian of ahyperplane section of a surface; - C.Ciliberto, H.Harris, M.Teixidor i Bigas: On the endomorphisms of Jac (W1d(C)) when p=1 and C has general moduli; - B. van Geemen: Projective models of Picard modular varieties; - J.Kollar, Y.Miyaoka, S.Mori: Rational curves on Fano varieties; - R. Salvati Manni: Modular forms of the fourth degree; A. Vistoli: Equivariant Grothendieck groups and equivariant Chow groups; - Trento examples; Open problems

The Shape of Space, Third Edition maintains the standard of excellence set by the previous editions. This lighthearted textbook covers the basic geometry and topology of two- and three-dimensional spaces-stretching students' minds as they learn to visualize new possibilities for the shape of our universe. Written by a master expositor, leading researcher in the field, and MacArthur Fellow, its informal exposition and engaging exercises appeal to an exceptionally broad audience, from liberal arts students to math undergraduate and graduate students looking for a clear intuitive understanding to supplement more formal texts, and even to laypeople seeking an entertaining self-study book to expand their understanding of space. Features of the Third Edition: Full-color figures throughout "Picture proofs" have replaced algebraic proofs Simpler handles-and-crosscaps approach to surfaces Updated discussion of cosmological applications Intuitive examples missing from many college and graduate school curricula About the Author: Jeffrey R. Weeks is a freelance geometer living in Canton, New York. With support from the U.S. National Science Foundation, the MacArthur Foundation and several science museums, his work spans pure mathematics, applications in cosmology and-closest to his heart-exposition for the general public.

With one exception, these papers are original and fully refereed research articles on various applications of Category Theory to Algebraic Topology, Logic and Computer Science. The exception is an outstanding and lengthy survey paper by Joyal/Street (80 pp) on a growing subject: it gives an account of classical Tannaka duality in such a way as to be accessible to the general mathematical reader, and to provide a key for entry to more recent developments and quantum groups. No expertise in either representation theory or category theory is assumed. Topics such as the Fourier cotransform, Tannaka duality for homogeneous spaces, braided tensor categories, Yang-Baxter operators, Knot invariants and quantum groups are introduced and studies. From the Contents: P.J. Freyd: Algebraically complete categories.- J.M.E. Hyland: First steps in synthetic domain theory.- G. Janelidze, W. Tholen: How algebraic is the change-of-base functor?.- A. Joyal, R. Street: An introduction to Tannaka duality and quantum groups.- A. Joyal, M. Tierney: Strong stacks andclassifying spaces.- A. Kock: Algebras for the partial map classifier monad.- F.W. Lawvere: Intrinsic co-Heyting boundaries and the Leibniz rule in certain toposes.- S.H. Schanuel: Negative sets have Euler characteristic and dimension.-

Introduction to the Theory of Optimization in Euclidean Space is intended to provide students with a robust introduction to optimization in Euclidean space, demonstrating the theoretical aspects of the subject whilst also providing clear proofs and applications. Students are taken progressively through the development of the proofs, where they have the occasion to practice tools of differentiation (Chain rule, Taylor formula) for functions of several variables in abstract situations. Throughout this book, students will learn the necessity of referring to important results established in advanced Algebra and Analysis courses. Features Rigorous and practical, offering proofs and applications of theorems Suitable as a textbook for advanced undergraduate students on mathematics or economics courses, or as reference for graduate-level readers Introduces complex principles in a clear, illustrative fashion

The present volume contains papers selected for presentation at the 14th Symposium on Mathematical Foundations of Computer Science - MFCS '89 held in Porabka-Kozubnik, Poland, from August 28 to September 1, 1989. Previous MFCs proceedings have also been published in the Lecture Notes in Computer Science. This volume presents investigations and results in theoretical computer science, in particular in the following areas: logics of programs, parallel and distributed computing, deductive databases, automata and formal languages, algorithms and data structures, software specification and validity, complexity and computability theory.

These are proceedings of an International Conference on Algebraic Topology, held 28 July through 1 August, 1986, at Arcata, California. The conference served in part to mark the 25th anniversary of the journal "Topology" and 60th birthday of Edgar H. Brown. It preceded ICM 86 in Berkeley, and was conceived as a successor to the Aarhus conferences of 1978 and 1982. Some thirty papers are included in this volume, mostly at a research level. Subjects include cyclic homology, H-spaces, transformation groups, real and rational homotopy theory, acyclic manifolds, the homotopy theory of classifying spaces, instantons and loop spaces, and complex bordism.

Since the subject of Groups of Self-Equivalences was first discussed in 1958 in a paper of Barcuss and Barratt, a good deal of progress has been achieved. This is reviewed in this volume, first by a long survey article and a presentation of 17 open problems together with a bibliography of the subject, and by a further 14 original research articles.

Die gesammelten mathematischen und philosophischen Werke von Hans Hahn erscheinen hier in einer dreibandigen Ausgabe. Sie enthalt samtli che Veroffentlichungen von Hahn, mit Ausnahme jener, die ursprtinglich in Buchform erschienen - dazu gehoren neben dem zweibandigen Werk tiber Reelle Funktionen auch die Einfuhrung in die Elemente der hdheren Mathematik, die er gemeinsam mit Heinrich Tietze schrieb, seine An merkungen zu Bolzanos Paradoxien des Unendlichen und mehrere Kapi tel fUr E. Pascals Repertorium der hdheren Mathematik. Nicht aufge nommen wurden auch die Buchbesprechungen von Hahn, bis auf seine Besprechung von Pringsheims Vorlesungen uber Zahlen- und Funktions lehre, die einen eigenen Aufsatz tiber die Grundlagen des Zahlbegriffs darstellt. Hahn war nicht nur einer der hervorragendsten Mathematiker dieses lahrhunderts: Sein EinfluB auf die Philosophie war auch hochst bedeut sam. Das kommt in der Einleitung, die sein ehemaliger Schiiler Sir Karl Popper fUr diese Gesamtausgabe geschrieben hat, deutlich zum Ausdruck. (Diese Einleitung ist der lctzte Essay, den Sir Karl Popper verfaBte. ) Hahn schrieb ausschlieBlich auf deutsch. Wir haben seine Arbeiten in Teilgebiete zusammengefaBt (was auch auf andere Art geschehen hatte konnen) und ihnenjeweils einen englischsprachigen Kommentar vorange stellt. Diese Kommentare, die von hervorragenden Experten stammen, be schreiben Hahns Arbeiten und ihre Wirkung."

This volume brings together papers from various fields of theoretical computer science, including computational geometry, parallel algorithms, algorithms on graphs, data structures and complexity of algorithms. Some of the invited papers include surveys of results in particular fields and some report original research, while all the contributed papers report original research. Most of the algorithms given are for parallel models of computation. The papers were presented at the Second International Symposium on Optimal Algorithms held in Varna, Bulgaria, in May/June 1989. The volume will be useful to researchers and students in theoretical computer science, especially in parallel computing.

The aim of this book is to teach the reader the topics in algebra which are useful in the study of computer science. In a clear, concise style, the author present the basic algebraic structures, and their applications to such topics as the finite Fourier transform, coding, complexity, and automata theory. The book can also be read profitably as a course in applied algebra for mathematics students.

This volume contains the papers presented at the Ninth International Conference on Automated Deduction (CADE-9) held May 23-26 at Argonne National Laboratory, Argonne, Illinois. The conference commemorates the twenty-fifth anniversary of the discovery of the resolution principle, which took place during the summer of 1963. The CADE conferences are a forum for reporting on research on all aspects of automated deduction, including theorem proving, logic programming, unification, deductive databases, term rewriting, ATP for non-standard logics, and program verification. All papers submitted to the conference were refereed by at least two referees, and the program committee accepted the 52 that appear here. Also included in this volume are abstracts of 21 implementations of automated deduction systems.

This volume contains the papers which were presented at the second workshop "Computer Science Logic" held in Duisburg, FRG, October 3-7, 1988. These proceedings cover a wide range of topics both from theoretical and applied areas of computer science. More specifically, the papers deal with problems arising at the border of logic and computer science: e.g. in complexity, data base theory, logic programming, artificial intelligence, and concurrency. The volume should be of interest to all logicians and computer scientists working in the above fields.

TAPSOFT '89 is the Third International Joint Conference on Theory and Practice of Software Development held in Barcelona, Spain, March 13-17, 1989. The conference consisted of three parts: - Advanced Seminar on Foundations of Innovative Software Development - Colloquium on Trees in Algebra and Programming (CAAP '89) - Colloquium on Current Issues in Programming Languages (CCIPL) The TAPSOFT '89 Conference Proceedings are published in two volumes. The first volume includes the papers from CAAP plus the more theoretical ones of the invited papers. The second volume comprises the papers from CCIPL and the invited papers more relevant to current issues in programming languages.

This volume contains the proceedings of ICALP 89, held at Stresa, Italy, July 11-15, 1989. ICALP 89 is the 16th International Colloquium on Automata, Languages and Programming in a series of meetings sponsored by the European Association for Theoretical Computer Science (EATCS). It is a broadly based conference covering all aspects of theoretical computer science including topics such as computability, automata theory, formal language theory, analysis of algorithms, computational complexity, mathematical aspects of programming language definition, logic and semantics of programming languages, foundations of logic programming, theorem proving, software specification, computational geometry, data types and data structures, theory of data bases and knowledge based systems, cryptography, VLSI structures, parallel and distributed computing, models of concurrency and robotics.

This volume of research papers is an outgrowth of the Manin Seminar at Moscow University, devoted to K-theory, homological algebra and algebraic geometry. The main topics discussed include additive K-theory, cyclic cohomology, mixed Hodge structures, theory of Virasoro and Neveu-Schwarz algebras.

This volume is the proceedings of the 3rd Workshop on the Mathematical Foundations of Programming Language Semantics held at Tulane University, New Orleans, Louisiana, April 8-10, 1987. The 1st Workshop was at Kansas State University, Manhattan, Kansas in April, 1985 (see LNCS 239), and the 2nd Workshop with a limited number of participants was at Kansas State in April, 1986. It was the intention of the organizers that the 3rd Workshop survey as many areas of the Mathematical Foundations of Programming Language Semantics as reasonably possible. The Workshop attracted 49 submitted papers, from which 28 papers were chosen for presentation. The papers ranged in subject from category theory and Lambda-calculus to the structure theory of domains and power domains, to implementation issues surrounding semantics.

This research monograph considers the subject of asymptotics from a nonstandard view point. It is intended both for classical asymptoticists - they will discover a new approach to problems very familiar to them - and for nonstandard analysts but includes topics of general interest, like the remarkable behaviour of Taylor polynomials of elementary functions. Noting that within nonstandard analysis, "small," "large," and "domain of validity of asymptotic behaviour" have a precise meaning, a nonstandard alternative to classical asymptotics is developed. Special emphasis is given to applications in numerical approximation by convergent and divergent expansions: in the latter case a clear asymptotic answer is given to the problem of optimal approximation, which is valid for a large class of functions including many special functions. The author's approach is didactical. The book opens with a large introductory chapter which can be read without much knowledge of nonstandard analysis. Here the main features of the theory are presented via concrete examples, with many numerical and graphic illustrations. N