Spacetime and Geometry: An Introduction to General Relativity


Sean Carroll - 2003
    With an accessible and lively writing style, it introduces modern techniques to what can often be a formal and intimidating subject. Readers are led from the physics of flat spacetime (special relativity), through the intricacies of differential geometry and Einstein's equations, and on to exciting applications such as black holes, gravitational radiation, and cosmology.

Coding the Matrix: Linear Algebra through Computer Science Applications


Philip N. Klein - 2013
    Mathematical concepts and computational problems are motivated by applications in computer science. The reader learns by "doing," writing programs to implement the mathematical concepts and using them to carry out tasks and explore the applications. Examples include: error-correcting codes, transformations in graphics, face detection, encryption and secret-sharing, integer factoring, removing perspective from an image, PageRank (Google's ranking algorithm), and cancer detection from cell features. A companion web site, codingthematrix.com provides data and support code. Most of the assignments can be auto-graded online. Over two hundred illustrations, including a selection of relevant "xkcd" comics. Chapters: "The Function," "The Field," "The Vector," "The Vector Space," "The Matrix," "The Basis," "Dimension," "Gaussian Elimination," "The Inner Product," "Special Bases," "The Singular Value Decomposition," "The Eigenvector," "The Linear Program"

Computers and Intractability: A Guide to the Theory of NP-Completeness


Michael R. Garey - 1979
    Johnson. It was the first book exclusively on the theory of NP-completeness and computational intractability. The book features an appendix providing a thorough compendium of NP-complete problems (which was updated in later printings of the book). The book is now outdated in some respects as it does not cover more recent development such as the PCP theorem. It is nevertheless still in print and is regarded as a classic: in a 2006 study, the CiteSeer search engine listed the book as the most cited reference in computer science literature.

MARVEL MATHEMATICS FOR MHT-CET


HEMANT G. AINAPURE
    CONTAINS MCQ'S

A Textbook of Engineering Mathematics


N.P. Bali - 2010
    The salient features of the book are as follows: It exactly covers the prescribed syllabus. Nothing undesirable has been included and nothing essential has been left. Its approach is explanatory and language is lucid and communicable. The exposition of the subject matter is systematic and the students are better prepared to solve the problems. All fundamentals of the included topics are explained with a micro-analysis. Sufficient number of solved examples have been given to let the students understand the various skills necessary to solve the problems. These examples are well-graded. Unsolved exercises of multi-varieties have been given in a well-graded style. Attempting those on his own, will enable a student to create confidence and independence in him/her regarding the understanding of the subject. Daily life problems and practical applications have been incorporated in the body of the text. A large number of attractive and accurate figures have been drawn which enable a student to grasp the subject in an easier way. All the answers have been checked and verified. About The Author: N.P. Bali is a prolific author of over 100 books for degree and engineering students. He has been writing books for more than forty years. His books on the following topics are well known for their easy comprehension and lucid presentation: Algebra, Trigonometry, Differential Calculus, Integral Calculus, Real Analysis, Co-ordinate Geometry, Statics, Dynamics etc. Dr. Manish Goyal has been associated with

Dragon Born 1: The Shifter's Hoard


Dante King - 2021
    Magic. Women. Riches. It's all going to be mine.

How to Solve It: Modern Heuristics


Zbigniew Michalewicz - 2004
    Publilius Syrus, Moral Sayings We've been very fortunate to receive fantastic feedback from our readers during the last four years, since the first edition of How to Solve It: Modern Heuristics was published in 1999. It's heartening to know that so many people appreciated the book and, even more importantly, were using the book to help them solve their problems. One professor, who published a review of the book, said that his students had given the best course reviews he'd seen in 15 years when using our text. There can be hardly any better praise, except to add that one of the book reviews published in a SIAM journal received the best review award as well. We greatly appreciate your kind words and personal comments that you sent, including the few cases where you found some typographical or other errors. Thank you all for this wonderful support.

Symmetry and the Beautiful Universe


Leon M. Lederman - 2004
    They write f

Introduction to Quantum Mechanics


David J. Griffiths - 1994
    The book s two-part coverage organizes topics under basic theory, and assembles an arsenal of approximation schemes with illustrative applications. For physicists and engineers. "

Computational Complexity


Christos H. Papadimitriou - 1993
    It offers a comprehensive and accessible treatment of the theory of algorithms and complexity—the elegant body of concepts and methods developed by computer scientists over the past 30 years for studying the performance and limitations of computer algorithms. The book is self-contained in that it develops all necessary mathematical prerequisites from such diverse fields such as computability, logic, number theory and probability.

Foundations of Complex Analysis


S. Ponnusamy - 2002
    Suitable for a two semester course in complex analysis, or as a supplementary text for an advanced course in function theory, this book aims to give students a good foundation of complex analysis and provides a basis for solving problems in mathematics, physics, engineering and many other sciences.

A Byte of Python


Swaroop C.H. - 2004
    An introduction to Python programming for beginners.