close
1.

電子ブック
ＥＢ
1. Software Configuration Management Using Vesta
David Gries, Allan Heydon, Clark Allan Heydon, Fred B. Schneider
出版情報: Springer eBooks Computer Science , Springer US, 2006
所蔵情報: loading…
目次情報: 続きを見る
Preface
Introducing Vesta / Part I：
Introduction / 1：
Some Scenarios / 1.1：
The Configuration Management Challenge / 1.2：
The Vesta Response / 1.3：
Essential Background / 2：
The Unix File System / 2.1：
Naming Files and Directories / 2.1.1：
Mount Points / 2.1.2：
Links / 2.1.3：
Properties of Files / 2.1.4：
Unix Processes / 2.2：
The Unix Shell / 2.3：
The Unix Programming Environment / 2.4：
Make / 2.5：
The Architecture of Vesta / 3：
System Components / 3.1：
Source Management Components / 3.1.1：
Build Components / 3.1.2：
Storage Components / 3.1.3：
Models and Modularity / 3.1.4：
Vesta's Core Properties / 3.2：
The User's View of Vesta / Part II：
Managing Sources and Versions / 4：
Names and Versions / 4.1：
The Source Name Space / 4.1.1：
Versioning / 4.1.2：
Naming Files and Packages / 4.1.3：
The Development Cycle / 4.2：
The Outer Loop / 4.2.1：
The Inner Loop / 4.2.2：
Detailed Operation of the Repository Tools / 4.2.3：
Version Control Alternatives / 4.2.4：
Additional Repository Tools / 4.2.5：
Mutable Files and Directories / 4.2.6：
Replication / 4.3：
Global Name Space / 4.3.1：
A Replication Example / 4.3.2：
The Replicator / 4.3.3：
Cross-Repository Check-out / 4.3.4：
Repository Metadata / 4.4：
Mutable Attributes / 4.4.1：
Access Control / 4.4.2：
Metadata and Replication / 4.4.3：
System Description Language / 5：
Motivation / 5.1：
Language Highlights / 5.2：
The Environment Parameter / 5.2.1：
Bindings / 5.2.2：
Tool Encapsulation / 5.2.3：
Closures / 5.2.4：
Imports / 5.2.5：
Building Systems in Vesta / 6：
The Organization of System Models / 6.1：
Hierarchies of System Models / 6.2：
Bridges and the Standard Environment / 6.2.1：
Library Models / 6.2.2：
Application Models / 6.2.3：
Putting It All Together / 6.2.4：
Control Panel Models / 6.2.5：
Customizing the Build Process / 6.3：
Handling Large Scale Software / 6.4：
Inside Vesta / Part III：
Inside the Repository / 7：
Support for Evaluation and Caching / 7.1：
Derived Files and Shortids / 7.1.1：
Evaluator Directories and Volatile Directories / 7.1.2：
Fingerprints / 7.1.3：
Inside the Repository Implementation / 7.2：
Directory Implementation / 7.2.1：
Shortids and Files / 7.2.2：
Longids / 7.2.3：
Copy-on-Write / 7.2.4：
NFS Interface / 7.2.5：
RPC Interfaces / 7.2.6：
Implementing Replication / 7.3：
Mastership / 7.3.1：
Agreement / 7.3.2：
Agreement-Preserving Primitives / 7.3.3：
Propagating Attributes / 7.3.4：
Incremental Building / 8：
Overview of Function Caching / 8.1：
Caching and Dynamic Dependencies / 8.2：
The Function Cache Interface / 8.3：
Computing Fine-Grained Dependencies / 8.4：
Representing Dependencies / 8.4.1：
Caching External Tool Invocations / 8.4.2：
Caching User-Defined Function Evaluations / 8.4.3：
Caching System Model Evaluations: A Special Case / 8.4.4：
Error Handling / 8.5：
Function Cache Implementation / 8.6：
Cache Lookup / 8.6.1：
Cache Entry Storage / 8.6.2：
Synchronization / 8.6.3：
Evaluation and Caching in Action / 8.7：
Scratch Build of the Standard Environment / 8.7.1：
Scratch Build of the Vesta Umbrella Library / 8.7.2：
Scratch and Incremental Builds of the Evaluator / 8.7.3：
Weeder / 9：
How Deletion is Specified / 9.1：
Implementation of the Weeder / 9.2：
The Function Call Graph / 9.2.1：
Concurrent Weeding / 9.2.2：
Assessing Vesta / Part IV：
Competing Systems / 10：
Loosely Connected Configuration Management Tools / 10.1：
RCS / 10.1.1：
CVS / 10.1.2：
Integrated Configuration Management Systems / 10.1.3：
DSEE / 10.2.1：
ClearCASE / 10.2.2：
Other Systems / 10.3：
Vesta System Performance / 11：
Platform Configuration / 11.1：
Overall System Performance / 11.2：
Performance Comparison with Make / 11.2.1：
Performance Breakdown / 11.2.2：
Caching Analysis / 11.2.3：
Resource Usage / 11.2.4：
Repository Performance / 11.3：
Speed of File Operations / 11.3.1：
Disk and Memory Consumption / 11.3.2：
Speed of Repository Tools / 11.3.3：
Speed of Cross-Repository Tools / 11.3.4：
Speed of the Replicator / 11.3.5：
Function Cache Performance / 11.4：
Server Performance / 11.4.1：
Measurements of the Stable Cache / 11.4.2：
Disk and Memory Usage / 11.4.3：
Function Cache Scalability / 11.4.4：
Weeder Performance / 11.5：
Interprocess Communication / 11.6：
Conclusions / 12：
Vesta in the Real World / 12.1：
Vesta in the Future / 12.2：
SDL Reference Manual / A：
Lexical Conventions / A.1：
Meta-notation / A.2.1：
Terminals / A.2.2：
Semantics / A.3：
Value Space / A.3.1：
Type Declarations / A.3.2：
Evaluation Rules / A.3.3：
Expr / A.3.3.1：
Literal / A.3.3.2：
Id / A.3.3.3：
List / A.3.3.4：
Binding / A.3.3.5：
Select / A.3.3.6：
Block / A.3.3.7：
Stmt / A.3.3.8：
Assign / A.3.3.9：
Iterate / A.3.3.10：
FuncDef / A.3.3.11：
FuncCall / A.3.3.12：
Model / A.3.3.13：
Files / A.3.3.14：
File Name Interpretation / A.3.3.15：
Pragmas / A.3.3.17：
Primitives / A.3.4：
Functions on Type t_bool / A.3.4.1：
Functions on Type t_int / A.3.4.2：
Functions on Type t_text / A.3.4.3：
Functions on Type t_list / A.3.4.4：
Functions on Type t_binding / A.3.4.5：
Special Purpose Functions / A.3.4.6：
Type Manipulation Functions / A.3.4.7：
Tool Invocation Function / A.3.4.8：
Diagnostic Functions / A.3.4.9：
Concrete Syntax / A.4：
Grammar / A.4.1：
Ambiguity Resolution / A.4.2：
Tokens / A.4.3：
Reserved Identifiers / A.4.4：
The Vesta Web Site / B：
References
Index
Preface
Introducing Vesta / Part I：
Introduction / 1：
2.

電子ブック
ＥＢ
2. Theory of Computation
Dexter C. Kozen, David Gries, Fred B. Schneider
出版情報: Springer eBooks Computer Science , Springer London, 2006
所蔵情報: loading…
目次情報: 続きを見る
Preface
Lectures
The Complexity of Computations / 1：
Time and Space Complexity Classes and Savitch's Theorem / 2：
Separation Results / 3：
The Immerman-Szelepcsenyi Theorem / 4：
Logspace Computability / 5：
The Circuit Value Problem / 6：
The Knaster-Tarski Theorem / A：
Alternation / 7：
Problems Complete for PSPACE / 8：
The Polynomial-Time Hierarchy / 9：
More on the Polynomial-Time Hierarchy / 10：
Parallel Complexity / 11：
Relation of NC to Time-Space Classes / 12：
Probabilistic Complexity / 13：
BPP [characters not reproducible] / 14：
Chinese Remaindering / B：
Complexity of Primality Testing / C：
Berlekamp's Algorithm / D：
Interactive Proofs / 15：
PSPACE [characters not reproducible] IP / 16：
IP [characters not reproducible] PSPACE / 17：
Probabilistically Checkable Proofs / 18：
NP [characters not reproducible] PCP (n[superscript 3], 1) / 19：
More on PCP / 20：
A Crash Course in Logic / E：
Complexity of Decidable Theories / 21：
Complexity of the Theory of Real Addition / 22：
Lower Bound for the Theory of Real Addition / 23：
Lower Bound for Integer Addition / 24：
Automata on Infinite Strings and S1S / 25：
Determinization of [omega]-Automata / 26：
Safra's Construction / 27：
Relativized Complexity / 28：
Nonexistence of Sparse Complete Sets / 29：
Unique Satisfiability / F：
Toda's Theorem / G：
Circuit Lower Bounds and Relativized PSPACE = PH / 30：
Lower Bounds for Constant Depth Circuits / 31：
The Switching Lemma / H：
Tail Bounds / I：
The Gap Theorem and Other Pathology / 32：
Partial Recursive Functions and Godel Numberings / 33：
Applications of the Recursion Theorem / 34：
Abstract Complexity / J：
The Arithmetic Hierarchy / 35：
Complete Problems in the Arithmetic Hierarchy / 36：
Post's Problem / 37：
The Friedberg-Muchnik Theorem / 38：
The Analytic Hierarchy / 39：
Kleene's Theorem / 40：
Fair Termination and Harel's Theorem / 41：
Exercises
Homework 1
Homework 2
Homework 3
Homework 4
Homework 5
Homework 6
Homework 7
Homework 8
Homework 9
Homework 10
Homework 11
Homework 12
Miscellaneous Exercises
Hints and Solutions
Homework 1 Solutions
Homework 2 Solutions
Homework 3 Solutions
Homework 4 Solutions
Homework 5 Solutions
Homework 6 Solutions
Homework 7 Solutions
Homework 8 Solutions
Homework 9 Solutions
Homework 10 Solutions
Homework 11 Solutions
Homework 12 Solutions
Hints for Selected Miscellaneous Exercises
Solutions to Selected Miscellaneous Exercises
References
Notation and Abbreviations
Index
Preface
Lectures
The Complexity of Computations / 1：
3.

電子ブック
ＥＢ
3. Fundamentals of the New Artificial Intelligence
Toshinori Munakata, David Gries, Fred B. Schneider
出版情報: Springer eBooks Computer Science , Springer London, 2008
所蔵情報: loading…
目次情報: 続きを見る
Preface
Introduction / 1：
An Overview of the Field of Artificial Intelligence / 1.1：
An Overview of the Areas Covered in this Book / 1.2：
Neural Networks: Fundamentals and the Backpropagation Model / 2：
What is a Neural Network? / 2.1：
A Neuron / 2.2：
Basic Idea of the Backpropagation Model / 2.3：
Details of the Backpropagation Mode / 2.4：
A Cookbook Recipe to Implement the Backpropagation Model / 2.5：
Additional Technical Remarks on the Backpropagation Model / 2.6：
Simple Perceptrons / 2.7：
Applications of the Backpropagation Model / 2.8：
General Remarks on Neural Networks / 2.9：
Neural Networks: Other Models / 3：
Prelude / 3.1：
Associative Memory / 3.2：
Hopfield Networks / 3.3：
The Hopfield-Tank Model for Optimization Problems: The Basics / 3.4：
One-Dimensional Layout / 3.4.1：
Two-Dimensional Layout / 3.4.2：
The Hopfield-Tank Model for Optimization Problems: Applications / 3.5：
The N-Queen Problem / 3.5.1：
A General Guideline to Apply the Hopfield-Tank Model to Optimization Problems / 3.5.2：
Traveling Salesman Problem (TSP) / 3.5.3：
The Kohonen Model / 3.6：
Simulated Annealing / 3.7：
Boltzmann Machines / 3.8：
An Overview / 3.8.1：
Unsupervised Learning by the Boltzmann Machine: The Basics Architecture / 3.8.2：
Unsupervised Learning by the Boltzmann Machine: Algorithms / 3.8.3：
Appendix. Derivation of Delta-Weights / 3.8.4：
Genetic Algorithms and Evolutionary Computing / 4：
What are Genetic Algorithms and Evolutionary Computing? / 4.1：
Fundamentals of Genetic Algorithms / 4.2：
A Simple Illustration of Genetic Algorithms / 4.3：
A Machine Learning Example: Input-to-Output Mapping / 4.4：
A Hard Optimization Example: the Traveling Salesman Problem (TSP) / 4.5：
Schemata / 4.6：
Changes of Schemata Over Generations / 4.6.1：
Example of Schema Processing / 4.6.2：
Genetic Programming / 4.7：
Additional Remarks / 4.8：
Fuzzy Systems / 5：
Fundamentals of Fuzzy Sets / 5.1：
What is a Fuzzy Set? / 5.2.1：
Basic Fuzzy Set Relations / 5.2.2：
Basic Fuzzy Set Operations and Their Properties / 5.2.3：
Operations Unique to Fuzzy Sets / 5.2.4：
Fuzzy Relations / 5.3：
Ordinary (Nonfuzzy) Relations / 5.3.1：
Fuzzy Relations Defined on Ordinary Sets / 5.3.2：
Fuzzy Relations Derived from Fuzzy Sets / 5.3.3：
Fuzzy Logic / 5.4：
Ordinary Set Theory and Ordinary Logic / 5.4.1：
Fuzzy Logic Fundamentals / 5.4.2：
Fuzzy Control / 5.5：
Fuzzy Control Basics / 5.5.1：
Case Study: Controlling Temperature with a Variable Heat Source / 5.5.2：
Extended Fuzzy if-then Rules Tables / 5.5.3：
A Note on Fuzzy Control Expert Systems / 5.5.4：
Hybrid Systems / 5.6：
Fundamental Issues / 5.7：
Rough Sets / 5.8：
Review of Ordinary Sets and Relations / 6.1：
Information Tables and Attributes / 6.3：
Approximation Spaces / 6.4：
Knowledge Representation Systems / 6.5：
More on the Basics of Rough Sets / 6.6：
Case Study and Comparisons with Other Techniques / 6.7：
Rough Sets Applied to the Case Study / 6.8.1：
ID3 Approach and the Case Study / 6.8.2：
Comparisons with Other Techniques / 6.8.3：
Chaos / 7：
What is Chaos? / 7.1：
Representing Dynamical Systems / 7.2：
Discrete dynamical systems / 7.2.1：
Continuous dynamical systems / 7.2.2：
State and Phase Spaces / 7.3：
Trajectory, Orbit and Flow / 7.3.1：
Cobwebs / 7.3.2：
Equilibrium Solutions and Stability / 7.4：
Attractors / 7.5：
Fixed-point attractors / 7.5.1：
Periodic attractors / 7.5.2：
Quasi-periodic attractors / 7.5.3：
Chaotic attractors / 7.5.4：
Bifurcations / 7.6：
Fractals / 7.7：
Applications of Chaos / 7.8：
Index
Preface
Introduction / 1：
An Overview of the Field of Artificial Intelligence / 1.1：
4.

電子ブック
ＥＢ
4. Multimedia Introduction to Programming Using Java
David Gries, Paul Gries
出版情報: Springer eBooks Computer Science , Springer New York, 2005
所蔵情報: loading…
5.

電子ブック
ＥＢ
5. Adapting Proofs-as-Programs
Iman Hafiz Poernomo, John N. Crossley, David Gries, Fred B. Schneider, Martin Wirsing
出版情報: Springer eBooks Computer Science , Springer New York, 2005
所蔵情報: loading…
6.

電子ブック
ＥＢ
6. Reverse Engineering of Object Oriented Code
Paolo Tonella, David Gries, Alessandra Potrich, Fred P. Schneider
出版情報: Springer eBooks Computer Science , Springer New York, 2005
所蔵情報: loading…
目次情報: 続きを見る
Introduction
Object flow graph
Class diagram
Object diagram
Interaction diagrams
State diagram
Package diagram
Conclusions
Appendixes for eLib program
References
Index
Introduction
Object flow graph
Class diagram
7.

電子ブック
ＥＢ
7. Super-Recursive Algorithms
Mark Semenovich Burgin, David Gries, Fred B. Schneider
出版情報: Springer eBooks Computer Science , Springer New York, 2005
所蔵情報: loading…
目次情報: 続きを見る
Introduction
Recursive Algorithms
Subrecursive Algorithms
Superrecursive Algorithms: Problems of computability
Superrecursive Algorithms: Problems of Efficiency
Conclusion: Problems of Information Technology and Computer Science Development
References and Sources for Additional Reading
Index
Introduction
Recursive Algorithms
Subrecursive Algorithms
8.

電子ブック
ＥＢ
8. Fundamentals of the New Artificial Intelligence
Toshinori Munakata, David Gries, Fred B. Schneider
出版情報: SpringerLink Books - AutoHoldings , Springer London, 2008
所蔵情報: loading…
目次情報: 続きを見る
Preface
Introduction / 1：
An Overview of the Field of Artificial Intelligence / 1.1：
An Overview of the Areas Covered in this Book / 1.2：
Neural Networks: Fundamentals and the Backpropagation Model / 2：
What is a Neural Network? / 2.1：
A Neuron / 2.2：
Basic Idea of the Backpropagation Model / 2.3：
Details of the Backpropagation Mode / 2.4：
A Cookbook Recipe to Implement the Backpropagation Model / 2.5：
Additional Technical Remarks on the Backpropagation Model / 2.6：
Simple Perceptrons / 2.7：
Applications of the Backpropagation Model / 2.8：
General Remarks on Neural Networks / 2.9：
Neural Networks: Other Models / 3：
Prelude / 3.1：
Associative Memory / 3.2：
Hopfield Networks / 3.3：
The Hopfield-Tank Model for Optimization Problems: The Basics / 3.4：
One-Dimensional Layout / 3.4.1：
Two-Dimensional Layout / 3.4.2：
The Hopfield-Tank Model for Optimization Problems: Applications / 3.5：
The N-Queen Problem / 3.5.1：
A General Guideline to Apply the Hopfield-Tank Model to Optimization Problems / 3.5.2：
Traveling Salesman Problem (TSP) / 3.5.3：
The Kohonen Model / 3.6：
Simulated Annealing / 3.7：
Boltzmann Machines / 3.8：
An Overview / 3.8.1：
Unsupervised Learning by the Boltzmann Machine: The Basics Architecture / 3.8.2：
Unsupervised Learning by the Boltzmann Machine: Algorithms / 3.8.3：
Appendix. Derivation of Delta-Weights / 3.8.4：
Genetic Algorithms and Evolutionary Computing / 4：
What are Genetic Algorithms and Evolutionary Computing? / 4.1：
Fundamentals of Genetic Algorithms / 4.2：
A Simple Illustration of Genetic Algorithms / 4.3：
A Machine Learning Example: Input-to-Output Mapping / 4.4：
A Hard Optimization Example: the Traveling Salesman Problem (TSP) / 4.5：
Schemata / 4.6：
Changes of Schemata Over Generations / 4.6.1：
Example of Schema Processing / 4.6.2：
Genetic Programming / 4.7：
Additional Remarks / 4.8：
Fuzzy Systems / 5：
Fundamentals of Fuzzy Sets / 5.1：
What is a Fuzzy Set? / 5.2.1：
Basic Fuzzy Set Relations / 5.2.2：
Basic Fuzzy Set Operations and Their Properties / 5.2.3：
Operations Unique to Fuzzy Sets / 5.2.4：
Fuzzy Relations / 5.3：
Ordinary (Nonfuzzy) Relations / 5.3.1：
Fuzzy Relations Defined on Ordinary Sets / 5.3.2：
Fuzzy Relations Derived from Fuzzy Sets / 5.3.3：
Fuzzy Logic / 5.4：
Ordinary Set Theory and Ordinary Logic / 5.4.1：
Fuzzy Logic Fundamentals / 5.4.2：
Fuzzy Control / 5.5：
Fuzzy Control Basics / 5.5.1：
Case Study: Controlling Temperature with a Variable Heat Source / 5.5.2：
Extended Fuzzy if-then Rules Tables / 5.5.3：
A Note on Fuzzy Control Expert Systems / 5.5.4：
Hybrid Systems / 5.6：
Fundamental Issues / 5.7：
Rough Sets / 5.8：
Review of Ordinary Sets and Relations / 6.1：
Information Tables and Attributes / 6.3：
Approximation Spaces / 6.4：
Knowledge Representation Systems / 6.5：
More on the Basics of Rough Sets / 6.6：
Case Study and Comparisons with Other Techniques / 6.7：
Rough Sets Applied to the Case Study / 6.8.1：
ID3 Approach and the Case Study / 6.8.2：
Comparisons with Other Techniques / 6.8.3：
Chaos / 7：
What is Chaos? / 7.1：
Representing Dynamical Systems / 7.2：
Discrete dynamical systems / 7.2.1：
Continuous dynamical systems / 7.2.2：
State and Phase Spaces / 7.3：
Trajectory, Orbit and Flow / 7.3.1：
Cobwebs / 7.3.2：
Equilibrium Solutions and Stability / 7.4：
Attractors / 7.5：
Fixed-point attractors / 7.5.1：
Periodic attractors / 7.5.2：
Quasi-periodic attractors / 7.5.3：
Chaotic attractors / 7.5.4：
Bifurcations / 7.6：
Fractals / 7.7：
Applications of Chaos / 7.8：
Index
Preface
Introduction / 1：
An Overview of the Field of Artificial Intelligence / 1.1：
9.

電子ブック
ＥＢ
9. Adapting Proofs-as-Programs
Iman Hafiz Poernomo, John N. Crossley, David Gries, Fred B. Schneider, Martin Wirsing
出版情報: SpringerLink Books - AutoHoldings , Springer New York, 2005
所蔵情報: loading…
10.

電子ブック
ＥＢ
10. Theory of Computation
Dexter C. Kozen, David Gries, Fred B. Schneider
出版情報: SpringerLink Books - AutoHoldings , Springer London, 2006
所蔵情報: loading…
目次情報: 続きを見る
Preface
Lectures
The Complexity of Computations / 1：
Time and Space Complexity Classes and Savitch's Theorem / 2：
Separation Results / 3：
The Immerman-Szelepcsenyi Theorem / 4：
Logspace Computability / 5：
The Circuit Value Problem / 6：
The Knaster-Tarski Theorem / A：
Alternation / 7：
Problems Complete for PSPACE / 8：
The Polynomial-Time Hierarchy / 9：
More on the Polynomial-Time Hierarchy / 10：
Parallel Complexity / 11：
Relation of NC to Time-Space Classes / 12：
Probabilistic Complexity / 13：
BPP [characters not reproducible] / 14：
Chinese Remaindering / B：
Complexity of Primality Testing / C：
Berlekamp's Algorithm / D：
Interactive Proofs / 15：
PSPACE [characters not reproducible] IP / 16：
IP [characters not reproducible] PSPACE / 17：
Probabilistically Checkable Proofs / 18：
NP [characters not reproducible] PCP (n[superscript 3], 1) / 19：
More on PCP / 20：
A Crash Course in Logic / E：
Complexity of Decidable Theories / 21：
Complexity of the Theory of Real Addition / 22：
Lower Bound for the Theory of Real Addition / 23：
Lower Bound for Integer Addition / 24：
Automata on Infinite Strings and S1S / 25：
Determinization of [omega]-Automata / 26：
Safra's Construction / 27：
Relativized Complexity / 28：
Nonexistence of Sparse Complete Sets / 29：
Unique Satisfiability / F：
Toda's Theorem / G：
Circuit Lower Bounds and Relativized PSPACE = PH / 30：
Lower Bounds for Constant Depth Circuits / 31：
The Switching Lemma / H：
Tail Bounds / I：
The Gap Theorem and Other Pathology / 32：
Partial Recursive Functions and Godel Numberings / 33：
Applications of the Recursion Theorem / 34：
Abstract Complexity / J：
The Arithmetic Hierarchy / 35：
Complete Problems in the Arithmetic Hierarchy / 36：
Post's Problem / 37：
The Friedberg-Muchnik Theorem / 38：
The Analytic Hierarchy / 39：
Kleene's Theorem / 40：
Fair Termination and Harel's Theorem / 41：
Exercises
Homework 1
Homework 2
Homework 3
Homework 4
Homework 5
Homework 6
Homework 7
Homework 8
Homework 9
Homework 10
Homework 11
Homework 12
Miscellaneous Exercises
Hints and Solutions
Homework 1 Solutions
Homework 2 Solutions
Homework 3 Solutions
Homework 4 Solutions
Homework 5 Solutions
Homework 6 Solutions
Homework 7 Solutions
Homework 8 Solutions
Homework 9 Solutions
Homework 10 Solutions
Homework 11 Solutions
Homework 12 Solutions
Hints for Selected Miscellaneous Exercises
Solutions to Selected Miscellaneous Exercises
References
Notation and Abbreviations
Index
Preface
Lectures
The Complexity of Computations / 1：
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼