close
1.

図書

図書
Helmut Alt (ed.)
出版情報: Berlin : Springer, c2001  vi, 171 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2122
所蔵情報: loading…
目次情報: 続きを見る
Lattice Paths and Determinants / Martin Aigner
The Nearest Neighbor / Helmut Alt
Explicit and Implicit Enforcing - Randomized Optimization / Bernd Gärtner ; Emo Welzl
Codes over Z4 / Tor Helleseth
Degree Bounds for Long Paths and Cycles in k-connected Graphs / Heinz Adolf Jung
Data Structures for Boolean Functions / Christoph Meinel ; Christian Stangier
Scheduling under Uncertainty: Bounding the Makespan Distribution / Rolf H. Möhring
Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders / Hans Jürgen Prömel ; Anusch Taraz
Division-Free Algorithms for the Determinant and the Pfaffian: Algebraic and Combinatorial Approaches / Günter Rote
Check Character Systems and Anti-symmetric Mappings / Ralph-Hardo Schulz
Algorithms in Pure Mathematics / Gernot Stroth
Coloring Hamming Graphs, Optimal Binary Codes, and the 0/1-Borsuk Problem in Low Dimensions / Gunter M. Ziegler
Author Index
Lattice Paths and Determinants / Martin Aigner
The Nearest Neighbor / Helmut Alt
Explicit and Implicit Enforcing - Randomized Optimization / Bernd Gärtner ; Emo Welzl
2.

図書

図書
S. K. Chakraborty, B. K. Sarkar
出版情報: New Delhi ; [Oxford] : Oxford University Press, 2011  xvi, 567 p., [2] p. of plates ; 25 cm
シリーズ名: Oxford higher education
所蔵情報: loading…
3.

図書

図書
Dieter van Melkebeek
出版情報: Berlin ; New York : Springer-Verlag, c2000  xv, 196 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1950
所蔵情報: loading…
4.

図書

図書
Guerino Mazzola, Gérard Milmeister, Jody Weissmann
出版情報: Berlin : Springer, c2004  xii, 357 p. ; 24 cm
シリーズ名: Universitext ; . Comprehensive mathematics for computer scientists ; 1
所蔵情報: loading…
目次情報: 続きを見る
Sets, Numbers, and Graphs / I:
Fundamentals-Concepts and Logic / 1:
Propositional Logic / 1.1:
Architecture of Concepts / 1.2:
Axiomatic Set Theory / 2:
The Axioms / 2.1:
Basic Concepts and Results / 2.2:
Boolean Set Algebra / 3:
The Boolean Algebra of Subsets / 3.1:
Functions and Relations / 4:
Graphs and Functions / 4.1:
Relations / 4.2:
Ordinal and Natural Numbers / 5:
Ordinal Numbers / 5.1:
Natural Numbers / 5.2:
Recursion Theorem and Universal Properties / 6:
Recursion Theorem / 6.1:
Universal Properties / 6.2:
Universal Properties in Relational Database Theory / 6.3:
Natural Arithmetic / 7:
Natural Operations / 7.1:
Euclid and the Normal Forms / 7.2:
Infinities / 8:
The Diagonalization Procedure / 8.1:
The Classical Number Domains ${\op Z}, {\op Q}, {\op R}$ and ${\op C}$ / 9:
Integers ${\op Z}[$ / 9.1:
Rationals ${\op Q}$ / 9.2:
Real Numbers ${\op R}$ / 9.3:
Complex Numbers ${\op C}$ / 9.4:
Categories of Graphs / 10:
Directed and Undirected Graphs / 10.1:
Morphisms of Digraphs and Graphs / 10.2:
Cycles / 10.3:
Construction of Graphs / 11:
Some Special Graphs / 12:
n-ary Trees / 12.1:
Moore Graphs / 12.2:
Planarity / 13:
Euler's Formula for Polyhedra / 13.1:
Kuratowski's Planarity Theorem / 13.2:
First Advanced Topic / 14:
Floating Point Arithmetic / 14.1:
Example for an Addition / 14.2:
Algebra, Formal Logic, and Linear Geometry / II:
Monoids, Groups, Rings, and Fields / 15:
Monoids / 15.1:
Groups / 15.2:
Rings / 15.3:
Fields / 15.4:
Primes / 16:
Prime Factorization / 16.1:
Roots of Polynomials and Interpolation / 16.2:
Formal Propositional Logic / 17:
Syntactics: The Language of Formal Propositional Logic / 17.1:
Semantics: Logical Algebras / 17.2:
Signification: Valuations / 17.3:
Axiomatics / 17.4:
Formal Predicate Logic / 18:
Syntactics: First-order Language / 18.1:
Semantics: S-Structures / 18.2:
Signification: Models / 18.3:
Languages, Grammars, and Automata / 19:
Languages / 19.1:
Grammars / 19.2:
Automata and Acceptors / 19.3:
Categories of Matrixes / 20:
What Matrixes Are / 20.1:
Standard Operations on Matrixes / 20.2:
Square Matrixes and their Determinant / 20.3:
Modules and Vector Spaces / 21:
Linear Dependence, Bases, and Dimension / 22:
Bases in Vector Spaces / 22.1:
Equations / 22.2:
Affine Homomorphisms / 22.3:
Algorithms in Linear Algebra / 23:
Gauss Elimination / 23.1:
The LUP Decomposition / 23.2:
Linear Geometry / 24:
Euclidean Vector Spaces / 24.1:
Trigonometric Functions from Two-Dimensional Rotations / 24.2:
Gram's Determinant and the Schwarz Inequality / 24.3:
Eigenvalues, the Vector Product, and Quaternions / 25:
Eigenvalues and Rotations / 25.1:
The Vector Product / 25.2:
Quaternions / 25.3:
Second Advanced Topic / 26:
Galois Fields / 26.1:
The Reed-Solomon (RS) Error Correction Code / 26.2:
The Rivest-Shamir-Adelman (RSA) Encryption Algorithm / 26.3:
Further Reading / A:
Index
Sets, Numbers, and Graphs / I:
Fundamentals-Concepts and Logic / 1:
Propositional Logic / 1.1:
5.

図書

図書
Erich Grädel, Wolfgang Thomas, Thomas Wilke (eds.)
出版情報: Berlin ; Tokyo : Springer, c2002  viii, 385 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2500
所蔵情報: loading…
6.

図書

図書
James L. Hein
出版情報: Boston : Jones & Bartlett Publishers, 1995  xvi, 656 p. ; 25 cm
所蔵情報: loading…
7.

図書

図書
edited by G.M. Reed, A.W. Roscoe, and R.F. Wachter
出版情報: Oxford : Clarendon Press , New York : Oxford University Press, c1991  390 p. ; 24 cm
所蔵情報: loading…
目次情報: 続きを見る
Topology, computer science and the mathematics of convergence / A.W. Roscoe
The soundness and completeness of axioms for CSP processes / Stepen Blamey
Classifying unbounded nondeterminism in CSP / Geoff Barrett ; Michael Goldsmith
Algebraic posets, algebraic cpo's and models of concurrency / Michael W. Mislove
Concurrency semantics based on metric domain equations / J.W. de Bakker ; J.J.M.M. Rutten
On topological characterization of behavioral properties / Marta Z. Kwiatkowska
Order and strongly sober compactifications / J.D. Lawson
Totally bounded spaces and compact ordered spaces as domains of computation / Michael B. Smyth
A characterization of effective topological spaces II / Dieter Spreen
The importance of cardinality, separability, and compactness in computer science with an example from numerical signal analysis / Klaus E. Grue
Digital topology: a comparison of the graph-based and topological approaches / T.Y. Kong
Tiling the plane with one tile / D. Girault-Beauquier ; M. Nivat
An algebraic axiomatization of linear logic models / Narcisco Marti-Oliet ; Jose Meseguer
Types as theories / Joseph A. Goguen
Topology, computer science and the mathematics of convergence / A.W. Roscoe
The soundness and completeness of axioms for CSP processes / Stepen Blamey
Classifying unbounded nondeterminism in CSP / Geoff Barrett ; Michael Goldsmith
8.

図書

図書
H.F. Mattson, Jr.
出版情報: New York : J. Wiley, c1993  xxv, 637 p. ; 25 cm
所蔵情報: loading…
目次情報: 続きを見る
Logic
Mathematical Induction
Equivalence Relations and Partitions
Functions
Divisibility in the Integers
Congruences
The Binomial Theorem
Counting
Probability
Recurrence Relations
Matrices and Order Relations
Trees
Graphs
Answers to Selected Problems
Index
Logic
Mathematical Induction
Equivalence Relations and Partitions
9.

図書

図書
Robert Hermann
出版情報: Brookline, MA : Math Sci Press, c1991  xiii, 400 p. ; 24 cm
シリーズ名: Interdisciplinary mathematics ; v. 25
所蔵情報: loading…
10.

図書

図書
Rainer Burkard, Mauro Dell'Amico, Silvano Martello
出版情報: Philadelphia : Society for Industrial and Applied Mathematics(SIAM), [2012], c2009  xxii, 393 p. ; 26 cm
所蔵情報: loading…
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼