2006, 600 p., Softcover
ISBN: 0-387-31004-5
About this textbook
Logic Synthesis and Verification Algorithms blends mathematical
foundations and algorithmic developments with circuit design
issues. Each new technique is presented in the context of its
application to design. Through the study of optimal two-level and
multilevel combinational circuit design, the reader is introduced
to basic concepts, such as Boolean algebras, local search, and
algebraic factorization.
Similarly, through the study of optimal sequential circuit
design, the reader is introduced to graph algorithms, finite
state systems, and language theory. Throughout the book,
recurrent themes such as branch and bound, dynamic programming,
and symbolic implicit enumeration are used to establish optimal
design principles.
Circuit designers and CAD tool developers alike will find Logic
Synthesis and Verification Algorithms useful as an introductory
and reference text. The rich collection of examples and solved
problems make this book ideal for self study.
Because of its careful balance of theory and application, Logic
Synthesis and Verification Algorithms will serve well as a
textbook for upper division and first year graduate students in
electrical and computer engineering.
Table of contents
I: Introduction.1. Introduction.2. A Quick Tour of Logic
Synthesis with the Help of a Simple Example.- II: Two Level Logic
Synthesis. 3. Boolean Algebras. 4. Synthesis of Two-Level
Circuits. 5. Heuristic Minimization of Two-Level Circuits. 6.
Binary Decision Diagrams (BDDs).- III: Models of Sequential
Systems. 7. Models of Sequential Systems. 8. Synthesis and
Verification of Finite State Machines. 9. Finite Automata. IV:
Multilevel Logic Synthesis. 10. Multi-Level Logic Synthesis. 11.
Multi-Level Minimization. 12. Automatic Test Generation for
Combinational Circuits. 13. Technology Mapping. A. ASCII Codes. B.
Supplementary Problems.- Bibliography.- Index.
Series: Texts in Computer Science
2006, XIV, 426 p. 1 illus., Hardcover
ISBN: 1-84628-297-7
Due: May 2006
About this textbook
This textbook has been written with the dual purpose to cover
core material in the foundations of computing for graduate
students in computer science, as well as to provide an
introduction to some more advanced topics for those intending
further study in the area.
This book contains an invaluable collection of lectures for first-year
graduates on the theory of computation, focusing primarily on
computational complexity theory. Topics and features include:
Organization into self-contained lectures of 3-7 pages;
41 primary lectures and a handful of supplementary lectures
covering more specialized or advanced topics;
12 homework sets and several miscellaneous homework exercises of
varying levels of difficulty, many with hints and complete
solutions.
Aimed at advanced undergraduates and first-year graduates in
Computer Science or Mathematics with an interest in the theory of
computation and computational complexity, this book provides a
thorough grounding the foundations of computational complexity
theory.
Table of contents
The Complexity of Computations.- Time and Space Complexity
Classes and Savitchfs Theorem.- Separation Results.- Logspace
Computability.- The Circuit Value Problem.- The Knaster-Tarski
Theorem.- Alternation.- The Polynomial-Time Hierarchy.- Parallel
Complexity.- Probabilistic Complexity.- Chinese Remaindering.-
Berlekampfs Algorithm.- Interactive Proofs.- Probabilistically
Checkable Proofs.- Complexity of Decidable Theories.- Complexity
of the Theory of Real Addition.- Lower Bound for the Theory of
Real Addition.- Safrafs Construction.- Relativized Complexity.-
Nonexistence of Sparse Complete Sets.- Unique Satisfiability.-
Todafs Theorem.- Lower Bounds for Constant Depth Circuits.- The
Switching Lemma.- Tail Bounds.- Applications of the Recursion
Theorem.- The Arithmetic Hierarchy.- Complete Problems in the
Arithmetic Hierarchy.- Postfs Problem.- The Friedberg?Muchnik
Theorem.- The Analytic Hierarchy.- Kleenefs Theorem.- Fair
Termination and Harelfs Theorem.- Exercises.- Hints and
Solutions.
Series: Bolyai Society Mathematical Studies, Vol. 15
2006, 405 p., Hardcover
ISBN: 3-540-32377-5
About this book
Discrete mathematics, including (combinatorial) number theory and
set theory has always been a stronghold of Hungarian mathematics.
The present volume honouring Vera Sos and Andras Hajnal contains
survey articles (with classical theorems and state-of-the-art
results) and cutting edge expository research papers with new
theorems and proofs in the area of the classical Hungarian
subjects, like extremal combinatorics, colorings, combinatorial
number theory, etc. The open problems and the latest results in
the papers inspire further research.
The volume is recommended to experienced specialists as well as
to young researchers and students.
Table of contents
Contents.- Preface.- M. Beck, X. Wang, T. Zaslavsky: A Unifying
Generalization of Spernerfs Theorem.- Y.F. Bilu, D. Masser: A
Quick Proof of Sprindzhukfs Decomposition Theorem.- B.
Bollobas, A.D. Scott: Discrepancy in Graphs and Hypergraphs.- E.
Czabarka, O. Sykora, L.A. Szekely, I. Vrtfo: Biplanar Crossing
Numbers I: A Survey of Results and Problems.- C. Doche, M. Mendes
France: An Exercise on the Average Number of Real Zeros of Random
Real Polynomials.- A. Frank: Edge-Connection of Graphs, Digraphs,
and Hypergraphs.- K. Gyory: Perfect Powers in Products with
Consecutive Terms from Arithmetic Progressions.- I. Juhasz, A.
Szymanski: The Topological Version of Fodorfs Theorem.- A.
Kostochka: Color-Critical Graphs and Hypergraphs with Few Edges:
A Survey.- M. Krivelevich, B. Sudakov: Pseudo-random Graphs.- J.
Nesetril: Bounds and Extrema for Classes of Graphs and Finite
Structures.- J. Pach, R. Radoicic, G. Toth: Relaxing Planarity
for Topological Graphs.- A. Petho: Notes on CNS Polynominals and
Integral Interpolation.- A. Recski, D. Szeszler: The Evolution of
an Idea ? Gallaifs Algorithm.- A. Sarkozy: On the Number of
Additive Representations of Integers.- L. Soukup: A Lifting
Theorem on Forcing LCS Spaces.- A. Thomason: Extremal Functions
for Graph Minors.- A Tijdeman: Periodicity and Almost-Periodicity.
Series: Fundamental Theories of Physics, Vol. 151
2006, XVI, 329 p., Hardcover
ISBN: 1-4020-4517-4
About this book
Antimatter, already conjectured by A. Schuster in 1898, was
actually predicted by P.A.M. Dirac in the late 19-twenties in the
negative-energy solutions of the Dirac equation. Its existence
was subsequently confirmed via the Wilson chamber and became an
established part of theoretical physics.
Dirac soon discovered that particles with negative energy do not
behave in a physically conventional manner, and he therefore
developed his "hole theory". This restricted the study
of antimatter to the sole level of second quantization.
As a result antimatter created a scientific imbalance, because
matter was treated at all levels of study, while antimatter was
treated only at the level of second quantization.
In search of a new mathematics for the resolution of this
imbalance the author conceived what we know today as Santillifs
isodual mathematics, which permitted the construction of isodual
classical mechanics, isodual quantization and isodual quantum
mechanics.
The scope of this monograph is to show that our classical,
quantum and cosmological knowledge of antimatter is at its
beginning with much yet to be discovered, and that a commitment
to antimatter by experimentalists will be invaluable to
antimatter science.
Table of contents
PREFACE.
1: INTRODUCTION. 1.1 The Scientific Imbalance Caused by
Antimatter. 1.2 Guide to the Monograph. 1.3 The Scientific
Imbalance Caused by Special Relativity and Quantum Mechanics for
Matter and Antimatter. 1.4 The Scientific Imbalance Caused by
General Relativity and Quantum Gravity for Matter and Antimatter.
1.5 Hadronic Mechanics.
2: ISODUAL THEORY OF POINT-LIKE ANTIPARTICLES. 2.1 Elements of
Isodual Mathematics. 2.2 Classical Isodual Theory of Point-like
Antiparticles. 2.3 Operator Isodual Theory of Point-like
Antiparticles.
3: LIE-ISOTOPIC AND LIE-ADMISSIBLE TREATMENTS OF EXTENDED
PARTICLES AND THEIR ISODUALS FOR EXTENDED ANTIPARTICLES. 3.1
Introduction. 3.2 Isomathematics for Extended particles and Its
Isodual for Extended Antiparticles. 3.3 Classical Iso-Hamiltonian
Mechanics and Its Isodual. 3.4 Lie-Isotopic Branch of Hadronic
Mechanics and Its Isodual. 3.5 Isorelativity and Its Isodual. 3.6
Lie-Admissible Branch of Hadronic Mechanics and Its Isodual. 3.7
Experimental Verifications and Industrial Applications of
Hadronic Mechanics.
4: ANTIGRAVITY AND SPACETIME MACHINES. 4.1 Theoretical
Predictions of Antigravity. 4.2 Experimental Verification of
Antigravity. 4.3 Causal Spacetime Machine.
5: GRAND-UNIFICATION AND COSMOLOGY. 5.1 Iso-Grand-Unification. 5.2
Iso-Self-Dual and Geno-Self-Dual Cosmologies. 5.3 Concluding
Remarks.
INDEX
Series: Topological Fixed Point Theory and Its Applications,
Vol. 4
2nd ed., 2006, Approx. 535 p., Hardcover
ISBN: 1-4020-4665-0
Due: April 2006
About this book
This book is devoted to the topological fixed point theory of
multivalued mappings including applications to differential
inclusions and mathematical economy. It is the first monograph
dealing with the fixed point theory of multivalued mappings in
metric ANR spaces. Although the theoretical material was
tendentiously selected with respect to applications, the text is
self-contained. Current results are presented.
This book will be especially useful for post-graduate students
and researchers interested in fixed point theory, and in
particular, topological methods in nonlinear analysis,
differential equations and dynamical systems. The content is also
likely to stimulate the interest of mathematical economists,
population dynamics experts as well as theoretical physicists
exploring the topological dynamics.
Table of contents
Preface.- Chapter I Background in Topology.- Chapter II
Multivalued Mappings.- Chapter III Approximation Methods in Fixed
Point Theory of Multivalued Mappings.- Chapter IV Homological
Methods in Fixed Point Theory of Multivalued Mappings.- Chapter V
Consequences and Applications.- Chapter VI Fixed Point Theory
Approach to Differental Inclusions.- Chapter VII Recent Results.-Bibliography.-
Index.