Cargando…
Probability and Algorithms.
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Washington :
National Academies Press,
1900.
|
| Temas: | |
| Acceso en línea: | Texto completo |
Tabla de Contenidos:
- ""PROBABILITY AND ALGORITHMS""; ""Copyright""; ""Preface""; ""Contents""; ""1. Introduction""; ""1.1 PROBABILISTIC ALGORITHMS""; ""1.1.1 Everyday Examples""; ""1.1.2 Hashing""; ""1.1.3 Geometry""; ""1.1.4 Competitive Analysis""; ""1.1.5 Random Constructions""; ""1.1.6 Testing Equality and Faith""; ""1.2 PROBABILISTIC ANALYSIS OF ALGORITHMS""; ""1.2.1 Sample Analyses: The Assignment Problem""; ""1.2.2 Quick Lessons from Quicksort""; ""1.3 HOW TO USE THIS SURVEY""; ""REFERENCES""; ""2. Simulated Annealing""; ""ABSTRACT""; ""2.1 THE METHOD""; ""2.2 CONVERGENCE ANALYSIS""; ""2.2.1 Basic Results""
- ""2.2.2 Taking the Instance Size into Account""""2.3 BEHAVIOR IN PRACTICE""; ""REFERENCES""; ""3. Approximate Counting Via Markov Chains""; ""ABSTRACT""; ""3.1 EXACT AND APPROXIMATE COUNTING""; ""3.2 RECURSIVE ESTIMATION OF SIZE""; ""3.3 THE MARKOV CHAIN METHOD OF SIMULATING A PROBABILITY DISTRIBUTION""; ""3.4 ESTIMATING MIXING TIMES""; ""3.5 CONCLUSION""; ""REFERENCES""; ""4. Probabilistic Algorithms for Speedup""; ""ABSTRACT""; ""4.1 INTRODUCTION""; ""4.2 PROBABILISTIC COMPLEXITY CLASSES""; ""4.3 PROBABILISTIC ALGORITHMS IN NUMBER THEORY: FACTORING AND PRIMALITY TESTING""
- ""Miller's Primality Test""""Solovay-Strassen Primality Test""; ""Dixon's Random Squares Factoring Algorithm""; ""4.4 COMMUNICATION COMPLEXITY""; ""Randomized Prime Protocol""; ""Repeated Equality Protocol""; ""REFERENCES""; ""5. Probabilistic Algorithms for Defeating Adversaries""; ""ABSTRACT""; ""5.1 INTRODUCTION""; ""5.2 EXAMPLES""; ""5.2.1 Authentication""; ""5.2.2 Computing with Encrypted Data""; ""5.3 ZERO-KNOWLEDGE PROOF SYSTEMS AND INSTANCE-HIDING SCHEMES""; ""REFERENCES""; ""6. Pseudorandom Numbers""; ""ABSTRACT""; ""6.1 INTRODUCTION""
- ""6.2 EXPLICIT CONSTRUCTIONS OF PSEUDORANDOM BIT GENERATORS""""6.3 COMPUTATIONAL INFORMATION THEORY AND CRYPTOGRAPHY""; ""6.4 PERFORMANCE OF CERTAIN PSEUDORANDOM BIT GENERATORS""; ""REFERENCES""; ""7. Probabilistic Analysis of Packing and Related Partitioning Problems""; ""ABSTRACT""; ""7.1 INTRODUCTION""; ""7.1.1 Problems""; ""7.1.2 Analysis""; ""7.1.3 Bp Algorithms""; ""7.1.4 Ms Algorithms""; ""7.2 ANALYTICAL TECHNIQUES""; ""7.2.1 Markov Chains""; ""7.2.2 Bounds""; ""7.2.3 Stochastic Planar Matching""; ""7.2.4 Linear Programming""; ""7.3 RELATED TOPICS""; ""7.3.1 Variants""
- ""7.3.2 Higher Dimensions""""7.3.3 General Bounds""; ""7.3.4 Distributions""; ""7.4 DIRECTIONS FOR FURTHER STUDY""; ""REFERENCES""; ""8. Probability and Problems in Euclidean Combinatorial Optimization""; ""ABSTRACT""; ""8.1 INTRODUCTION""; ""8.2 SUBADDITIVE EUCLIDEAN FUNCTIONALS""; ""8.3 TAIL PROBABILITIES""; ""8.4 THE TSP IN FRACTAL SPACES""; ""8.5 MINIMAL SPANNING TREES""; ""8.6 MATCHING PROBLEMS""; ""8.7 THE VALUES OF THE CONSTANTS""; ""8.8 THE CENTRAL LIMIT PROBLEM""; ""8.9 WORST-CASE GROWTH RATES""; ""8.10 CONCLUDING REMARKS""; ""REFERENCES""