|
|
 |
| Результат поиска |
Поиск книг, содержащих: Decision problem
| Книга | Страницы для поиска | | Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ | 839 | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1) | 14, 1336, 1602, 1604, 1605, 1621 | | Ito K. — Encyclopedic Dictionary of Mathematics. Vol. 2 | 71.B 97186.J | | Bilaniuk S. — A Problem Course in Mathematical Logic (vol. 2) | 1 | | Coste M. — Introduction to semialgebraic geometry | 39 | | Coste M. — An introduction to semialgebraic geometry | 39 | | Kneebone G.T. — Mathematical Logic and the Foundation of Mathematics | 279, 322, 392 ff. | | Haynes T.W., Hedetniemi S.T., Slater P.J. — Fundamentals of domination in graphs | 32 | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2) | 14, 1336, 1602, 1604, 1605, 1621 | | Tarski A. — Undecidable theories | 3f., 30, 32, 34f., 39f., 86; see also: Restricted decision problem | | Ferguson T.S. — Mathematical Statistics. A Decision Theoretic Approach | 7 | | Grotschel M., Lovasz L., Schrijver A. — Geometric Algorithms and Combinatorial Optimization | 24 | | Matijasevich Y. — Hilbert's 10th Problem | 1 | | Zimand M. — Computational Complexity: A Quantitative Perspective | 231 | | Niedermeier R. — Invitation to Fixed Parameter Algorithms | 6, 17 | | Ramirez Alfonsin J.L. — Diophantine Frobenius Problem | 185 | | Allouche J.-P., Shallit J. — Automatic Sequences: Theory, Applications, Generalizations | 147 | | Kemeny T., Snell J.L., Thompson G. — Introduction to finite mathematics | 171 | | Garey M.R., Johnson D.S. — Computers and intractability. A guide to the theory of NP-completeness | 13, 18—19. | | Sipser M. — Introduction to the theory of computation | 366 | | Hein J.L. — Discrete Mathematics | 369 | | Ito K. — Encyclopedic Dictionary of Mathematics | 71.B, 97, 186.J | | Kneale M. — Development of Logic | 724 ff. | | von zur Gathen J., Gerhard J. — Modern computer algebra | 685, 686 | | Tourlakis G.J. — Lectures in Logic and Set Theory: Mathematical Logic | 40, 188 | | Bernardo J.M., Smith A.F.M. — Bayesian Theory | x, 16—22 | | Hein J.L. — Discrete Structures, Logic, and Computability | 365, 739 | | Koblitz N., Wu Y.-H., Menezes A.J. — Algebraic Aspects of Cryptography | 35 | | Brualdi R.A., Ryser H.J. — Combinatorial Matrix Theory | 245—248 | | Kozen D.C. — The Design And Analysis Of Algorithms | 116, 139 | | Hein J.L. — Theory of Computation: An Introduction | 425, 483 | | Kreher D.L., Stinson D.R. — Combinatorial Algorithms: Generation, Enumeration and Search | 7, 13 | | Koblitz N., Menezes A.J. (Contributor), Wu Y.-H. (Contributor) — Algebraic Aspects of Cryptography | 35 | | Gentzen G. — The collected papers of Gerhard Gentzen | 6, 66, 69, 238, 239 | | Ding-Zhu D., Ker-I K. — Problem solving in automata, languages, and complexity | 243, 370 | | Jerrum M. — Counting, sampling and integrating: algorithms and complexity | 11 | | Astfalk G. — Applications on Advanced Architecture Computers | 257—260, 262, 263 | | Beth E.W. — The foundations of mathematics: A study in the philosophy of science | 75, 131, 149, 200, 212, 239ff., 242, 248, 253f., 414, 420, 435, 583ff. | | Hilbert D., Ackermann W. — Principles of mathematical logic | 112f, 132 | | Gibbons A. — Algorithmic graph theory | 221 | | Gibbons A. — Algorithmic graph theory | 221 | | Leeuwen J.V. — Handbook of Theoretical Computer Science: Algorithms and Complexity | 71 | | Stinson D.R. — Cryptography: Theory and practice | 178 | | Bridges D.S. — Computability: A mathematical sketchbook | 47 | | Leeuwen J. (ed.), Meyer A.R., Nivat M. — Algorithms and Complexity, Volume A | 71 | | Aldous J.M., Wilson R. — Graphs and Applications: An Introductory Approach | 339 | | Curry H.B. — Foundations of Mathematical Logic | 87, 357ff. | | Du D.-Z., Ko K.-I. — Theory of computational complexity | 58, 322 | | Tourlakis G.J. — Lectures in Logic and Set Theory: Set Theory | 41 | | Ackermann W. — Solvable Cases of the Decision Problem | 22 | | Anthony M. — Discrete Mathematics Of Neural Networks | 50 | | Elliott Mendelson — Introduction to mathematical logic | 265 | | Brady J.M. — The theory of computer science: A programming approach | 73 | | Bäck T. — Evolutionary Algorithms in Theory and Practice | 55 | | Andrews P.B. — An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof | 22, 53, 239 | | Sipser M. — Introduction to the Theory of Computation | 334 | | Burgisser P., Clausen M., Shokrollahi M.A. — Algebraic complexity theory | 117, 543 | | Horowitz E., Rajasekaran S., Sahui S. — Computer Algorithms | 498 | | Curry H.B. — Foundations of mathematical logic | 87, 357ff. | | Badii R., Politi A. — Complexity: Hierarchical structures and scaling in physics | 231 | | Keith Devlin — Mathematics: The New Golden Age | 268 | | Odifreddi P., Sangalli A., Dyson F. — The Mathematical Century: The 30 Greatest Problems of the Last 100 Years | 145—148 | | Shoenfield J.R. — Mathematical Logic | 106, 107 | | Lyndon R., Schupp P. — Combinatorial Group Theory (Classics in Mathematics) | 192 |
|
|
|
|
О проекте