MARC 닫기
00423nam ac200169 k 4500
000003581221
20220101120000
ta
010731s1991 US 000 eng
▼a 211070
▼c 211070
▼l WM0003026253
▼v 529
▼a QA75.5
▼a QA75.5
▼b L4
▼c 529
▼a FUNDAMENTALS OF COMPUTATION THEORY/
▼d BUDACH,L
▼a BERLIN:
▼b SPRINGER-VERLAG,
▼c 1991.
▼a 425p.
▼a BUDACH,L
▼a 단행본
WMO199926134
권 호 : 425
발행년 : 1991
서 명 : FUNDAMENTALS OF COMPUTATION THEORY
발행처 : BUDACH,L
목차
1. ON STRONG SEPARATIONS FROM AC
2. NUMBER THEORETIC ALGORITMS AND CRYPROLOGY
3. COMPUTATIONS OVER INFINITE GROUPS
4. EFFICIENCY OF MONTE CARLO ALGORITHMS IN NUMERICAL ANALYSIS
5. APPROXIMATION ALGORITMS FOR COUNTING PROBLEMS IN FINITE FIELDS
6. LOWER BOUNDS FOR DETERMINMISTIC AND NONDETERMINISTIC BRANCHING
7. PROGRAMS
8. GRAPH THEORETICAL METHODS FOR THE DESIGN OF PARALLEL ALGORITMS
9. LATTICE BASIS REDUCTION:IMPROVED PRACTICAL ALGORITHMS AND SOLVING
10. SUBSET SUM PROBLEMS
11. INFORMATION-BASED COMPLEXITY:RECENT RESULTS AND OPEN PROBLEMS
12. A SURVEY OF SOME ASPECTS OF COMPUTATIONAL LEARNING THEORY
13. RECENT PROGRESS IN CIRCUIT AND COMMUNICATION COMPLEXITY
14. FULL TCSP
서평쓰기