P vs NP経営｜Reference
Reference（年代順）
出典:『P vs NP経営』v1.0.112 ／ ソート: 執筆・口頭発表年（注記）→ 出版年。追加領域の候補文献も文献目録へ統合。
歴史的予想（Conjecture）は 別ページ に記録。
Bibliography Statistics （文献目録｜集計）
Total: 172 entries (one primary interdisciplinary field per entry; multi-label sum = 215). Field assignment is heuristic from title, authors, and notes. English labels are canonical; Japanese in parentheses is supplementary.
合計 172 件（主分類1つ＋副分類可。複数分野カウント合計 215）。英語を正本、日本語は補足。
Formal field labels & definitions （学際分野の正式名称と定義）
- Computational Complexity Theory （計算複雑性）
- Study of resources (time, space, randomness, advice) required to solve computational problems; includes P, NP, PSPACE, derandomization, and circuit complexity.
- Computability Theory & Mathematical Logic （計算可能性・論理学）
- What can be computed in principle; recursive functions, undecidability, proof theory, and foundations of mathematics.
- Cryptography, Formal Verification & Distributed Consensus （暗号・検証・合意）
- Secure protocols, zero-knowledge proofs, interactive/PCP verification, and fault-tolerant agreement (e.g., Byzantine generals).
- Information Theory & Algorithmic Information Theory （情報理論・記述長）
- Shannon information, Kolmogorov–Chaitin complexity, Solomonoff induction, and description-length principles.
- Probability, Statistics & Stochastic Processes （確率・統計・確率過程）
- Measure-theoretic probability, statistical inference, Markov processes, and stochastic models of dynamics.
- Quantum Computing & Quantum Information Science （量子計算・量子情報）
- Quantum algorithms, complexity classes (e.g., BQP), and information processing under quantum mechanics.
- Geometry, Topology & Algebra （幾何・トポロジー・代数）
- Structures of space, continuity, and algebraic systems; includes number theory, group theory, and geometric topology.
- Physics & Thermodynamics （物理学・熱力学）
- Physical law, energy, irreversibility, and statistical mechanics as constraints on information and computation.
- Chemistry & the Periodic System （化学・周期表）
- Chemical periodicity, classification of elements, and structure–property regularities.
- Computer Architecture & Computer Networks （計算機アーキテクチャ・ネットワーク）
- Machine organization, stored-program models, packet switching, and end-to-end networked systems.
- Cognitive Science, Decision Theory & Heuristic Search （認知・意思決定・探索）
- Bounded rationality, satisficing, problem-solving heuristics, and search under limited cognitive resources.
- Economics, Management, Institutions & Path Dependence （経済・経営・制度・経路依存）
- Increasing returns, lock-in, institutional change, organizational learning, and evolutionary economics.
- History & Philosophy of Science / Science and Technology Studies (STS) （科学史・科学論・STS）
- Historical development of scientific knowledge; sociology of science; science–technology–society relations.
By primary field （主分類）
| Field （日本語補足） | Count | Share |
|---|---|---|
| Computational Complexity Theory （計算複雑性） | 45 | 26.2% |
| Computability Theory & Mathematical Logic （計算可能性・論理学） | 29 | 16.9% |
| Cryptography, Formal Verification & Distributed Consensus （暗号・検証・合意） | 1 | 0.6% |
| Information Theory & Algorithmic Information Theory （情報理論・記述長） | 7 | 4.1% |
| Probability, Statistics & Stochastic Processes （確率・統計・確率過程） | 7 | 4.1% |
| Quantum Computing & Quantum Information Science （量子計算・量子情報） | 5 | 2.9% |
| Geometry, Topology & Algebra （幾何・トポロジー・代数） | 39 | 22.7% |
| Physics & Thermodynamics （物理学・熱力学） | 17 | 9.9% |
| Chemistry & the Periodic System （化学・周期表） | 2 | 1.2% |
| Computer Architecture & Computer Networks （計算機アーキテクチャ・ネットワーク） | 3 | 1.7% |
| Cognitive Science, Decision Theory & Heuristic Search （認知・意思決定・探索） | 6 | 3.5% |
| Economics, Management, Institutions & Path Dependence （経済・経営・制度・経路依存） | 5 | 2.9% |
| History & Philosophy of Science / Science and Technology Studies (STS) （科学史・科学論・STS） | 6 | 3.5% |
| Total （合計） | 172 | 100% |
Multi-label counts （複数分野カウント）
Entries spanning multiple fields are counted in each. 1文献が複数分野にまたがる場合は重複計上。
| Field （日本語補足） | Count |
|---|---|
| Computational Complexity Theory （計算複雑性） | 47 |
| Computability Theory & Mathematical Logic （計算可能性・論理学） | 33 |
| Cryptography, Formal Verification & Distributed Consensus （暗号・検証・合意） | 5 |
| Information Theory & Algorithmic Information Theory （情報理論・記述長） | 9 |
| Probability, Statistics & Stochastic Processes （確率・統計・確率過程） | 9 |
| Quantum Computing & Quantum Information Science （量子計算・量子情報） | 7 |
| Geometry, Topology & Algebra （幾何・トポロジー・代数） | 51 |
| Physics & Thermodynamics （物理学・熱力学） | 21 |
| Chemistry & the Periodic System （化学・周期表） | 3 |
| Computer Architecture & Computer Networks （計算機アーキテクチャ・ネットワーク） | 4 |
| Cognitive Science, Decision Theory & Heuristic Search （認知・意思決定・探索） | 7 |
| Economics, Management, Institutions & Path Dependence （経済・経営・制度・経路依存） | 12 |
| History & Philosophy of Science / Science and Technology Studies (STS) （科学史・科学論・STS） | 7 |
| Multi-label sum （延べ合計） | 215 |
古代
- Thales of Miletus (c. 624 BC–). Foundations of Geometry and Deductive Philosophy. Ancient Greece.
- Pythagoras of Samos (c. 582 BC–). Mathematical Mysticism and Cult of Integers. Ancient Greece.
- Euclid of Alexandria (c. 325 BC–). Elements. Ancient Greece.
17世紀
- Fermat, Pierre de (1607–1665). Methodus ad disquirendam maximam et minimam. France.
- Kepler, Johannes (1611). Strena seu de Nive Sexangula (On the Six-Cornered Snowflake). Germany.
- Archive Link
- Pascal, Blaise (1623–1662). Traité du triangle arithmétique. France.
- Newton, Isaac (1642–1727). Philosophiae Naturalis Principia Mathematica. United Kingdom.
- Fermat, Pierre de (1670). “Observations sur Diophante.” Published in Diophantus’ Arithmetica with commentary by Samuel de Fermat. France.
18世紀
- Euler, Leonhard (1707–1783). Introductio in analysin infinitorum. Switzerland/Russia.
19世紀
- Gauss, Carl Friedrich (1801). Disquisitiones Arithmeticae. Leipzig.
- Archive Link
- Hamilton, William Rowan (1805–1865). Lectures on Quaternions. Ireland.
- Abel, Niels Henrik (1824). Mémoire sur les équations algébriques, où l’on démontre l’impossibilité de la résolution de l’équation générale du cinquième degré. Norway.
- Galois, Évariste (1846). “Mémoire sur les conditions de résolubilité des équations par radicaux.” Journal de Mathématiques Pures et Appliquées, 11, 381–444. (Written in 1829, published posthumously by Liouville).
- Boole, George (1847). The Mathematical Analysis of Logic, Being an Essay towards a Calculus of Deductive Reasoning. Cambridge: Macmillan, Barclay, & Macmillan.
- Guthrie, Francis (1852). “Letter to Augustus De Morgan.” (communicated via Frederick Guthrie).
- PDF Reference
- Riemann, Bernhard (1859). “Über die Anzahl der Primzahlen unter einer gegebenen Grösse.” Monatsberichte der Königlichen Preussischen Akademie der Wissenschaften zu Berlin.
- Maxwell, James Clerk (1861–1862). “On Physical Lines of Force.” Philosophical Magazine.
- Chancourtois, Alexandre-Émile Béguyer de (1862). Vis tellurique (The Telluric Helix). France.
- Reference
- Newlands, John Alexander Reina (1864). “Relations Among Equivalents.” (Formulation of the Law of Octaves). Chemical News. United Kingdom.
- Reference
- Maxwell, James Clerk (1865). “A Dynamical Theory of the Electromagnetic Field.” Philosophical Transactions of the Royal Society of London, 155, 459–512.
- Riemann, Bernhard (1867). “Über die Hypothesen, welche der Geometrie zu Grunde liegen.” Abhandlungen der Königlichen Gesellschaft der Wissenschaften zu Göttingen, 13. (Lecture delivered in 1854).
- Mendeleev, Dmitri (1869). “On the Relationship of the Properties of the Elements to their Atomic Weights.” (Discovery of the Periodic Law). Journal of the Russian Chemical Society, 1, 60–77.
- Maxwell, James Clerk (1871). Theory of Heat. London: Longmans, Green, and Co.
- Boltzmann, Ludwig (1872). “Weitere Studien über das Wärmegleichgewicht unter Gasmolekülen.” (Further Studies on the Thermal Equilibrium of Gas Molecules / The H-Theorem). Sitzungsberichte der Kaiserlichen Akademie der Wissenschaften, 66, 275–370.
- PDF (English Translation)
- Klein, Felix (1872). Vergleichende Betrachtungen über neuere geometrische Forschungen (A Comparative Review of Recent Researches in Geometry / The Erlangen Program). Germany.
- Cantor, Georg (1874). “Ueber eine Eigenschaft des Inbegriffes aller reellen algebraischen Zahlen.” (On a property of the class of all real algebraic numbers). Journal für die reine und angewandte Mathematik, 77, 258–262.
- Lie, Sophus (1874). “Ueber Gruppen von Transformationen.” Nachrichten von der Königlichen Gesellschaft der Wissenschaften und der Georg-Augusts-Universität zu Göttingen, 515–540.
- Link
- Boltzmann, Ludwig (1877). “Über die Beziehung zwischen dem zweiten Hauptsatze der mechanischen Wärmetheorie und der Wahrscheinlichkeitsrechnung respektive den Sätzen über das Wärmegleichgewicht.” (Statistical Interpretation of Entropy). Sitzungsberichte der Kaiserlichen Akademie der Wissenschaften, 76, 373–435.
- PDF (English Translation)
- Frege, Gottlob (1879). Begriffsschrift, eine der arithmetischen nachgebildete Formelsprache des reinen Denkens. Halle.
- PDF (English Translation)
- Killing, Wilhelm (1888). “Die Zusammensetzung der stetigen endlichen Transformationsgruppen. Zweiter Theil.” Mathematische Annalen, 33(1), 1–48.
- Cartan, Élie (1894). Sur la structure des groupes de transformations finis et continus (Thèse). Paris: Nony.
1900–1949
- Hilbert, David (1900). “Mathematical Problems.” Lecture delivered before the International Congress of Mathematicians at Paris.
- Hilbert, David (1900). “Mathematische Probleme: Reihung der 23 Probleme (Problem 10).” Nachrichten von der Königlichen Gesellschaft der Wissenschaften zu Göttingen, 253–297.
- Planck, Max (1900). “Ueber eine Verbesserung der Wien’schen Spectralgleichung.” Verhandlungen der Deutschen Physikalischen Gesellschaft, 2, 202–204.
- Russell, Bertrand (1903). The Principles of Mathematics. Cambridge University Press.
- Poincaré, Henri (1904). “Cinquième complément à l’analysis situs.” Rendiconti del Circolo Matematico di Palermo, 18, 45–110.
- Einstein, Albert (1905). “Über einen die Erzeugung und Verwandlung des Lichtes betreffenden heuristischen Gesichtspunkt.” (On a Heuristic Point of View Concerning the Production and Transformation of Light). Annalen der Physik, 17, 132–148.
- Markov, A. A. (1906). “Extension of the law of large numbers to quantities, depending on each other.” Bulletin of the Society of the Physics-Mathematics at Kazan University, 2nd Series, Vol. 15, 135–156.
- Markov, Andrey A. (1906). “Распространение закона больших чисел на величины, зависящие друг от друга.” (Extension of the limit theorems of probability theory to a sum of variables connected in a chain). Notes of the Imperial Academy of Sciences of St. Petersburg.
- Reference
- Bohr, Niels (1913). “On the Constitution of Atoms and Molecules.” Philosophical Magazine, 26(151), 1–25.
- Markov, Andrey A. (1913). “An Example of Statistical Investigation of the Text of ‘Eugene Onegin’ Illustrating the Dependence of Samples in a Chain.” Bulletin de l’Académie Impériale des Sciences de St.-Pétersbourg.
- PDF (English Translation 2007)
- Moseley, Henry G. J. (1913). “The High-Frequency Spectra of the Elements.” Philosophical Magazine, 26, 1024–1034.
- Noether, Emmy (1918). “Invariante Variationsprobleme.” Nachrichten von der Gesellschaft der Wissenschaften zu Göttingen, 235–257.
- PDF (English Translation)
- Dickson, Leonard Eugene (1919). “On Quaternions and Their Generalization and the History of the Eight Square Theorem.” Annals of Mathematics, 20(3), 155–171.
- Wittgenstein, Ludwig (1921). Tractatus Logico-Philosophicus. Published in Annalen der Naturphilosophie.
- Bohr, Niels (1922). “The Structure of the Atom.” Nobel Lecture.
- Fraenkel, Adolf (1922). “Zu den Grundlagen der Cantor-Zermeloschen Mengenlehre.” Mathematische Annalen, 86(3-4), 230–237.
- PDF Reference
- Banach, Stefan, Tarski, Alfred (1924). “Sur la décomposition des ensembles de points en parties respectivement congruentes.” (On the decomposition of sets of points into respectively congruent parts). Fundamenta Mathematicae, 6, 244–277.
- Pauli, Wolfgang (1925). “Über den Zusammenhang des Abschlusses der Elektronengruppen im Atom mit der Komplexstruktur der Spektren.” (The Pauli Exclusion Principle). Zeitschrift für Physik, 31, 765–783.
- Hilbert, David, & Ackermann, Wilhelm (1928). Grundzüge der theoretischen Logik. （記号操作としての証明）
- Szilard, Leo (1929). “Über die Entropieverminderung in einem thermodynamischen System durch Eingriffe intelligenter Wesen.” (On the decrease of entropy in a thermodynamic system by the intervention of intelligent beings). Zeitschrift für Physik, 53, 840–856.
- Gödel, Kurt (1931). “Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I.” Monatshefte für Mathematik und Physik, 38, 173–198.
- Kolmogorov, Andrey N. (1933). Grundbegriffe der Wahrscheinlichkeitsrechnung. Berlin: Julius Springer.
- Archive Link
- Tarski, Alfred (1933/1956). “The Concept of Truth in Formalized Languages.” （真理概念の形式化）
- Gentzen, Gerhard (1935). “Untersuchungen über das logische Schließen.” （証明のシーケンス構造）
- Church, Alonzo (1936). “An Unsolvable Problem of Elementary Number Theory.” American Journal of Mathematics, 58(2), 345–363.
- Turing, Alan M. (1936). “On Computable Numbers, with an Application to the Entscheidungsproblem.” Proceedings of the London Mathematical Society, Series 2, 42, 230–265.
- Hahn, Otto, Strassmann, Fritz (1939). “Über den Nachweis und das Verhalten der bei der Bestrahlung des Urans mittels Neutronen entstehenden Erdalkalimetalle.” Die Naturwissenschaften, 27, 11–15.
- Meitner, Lise, Frisch, Otto Robert (1939). “Disintegration of Uranium by Neutrons: a New Type of Nuclear Reaction.” Nature, 143, 239–240.
- Oppenheimer, J. Robert, Snyder, Hartland (1939). “On Continued Gravitational Contraction.” Physical Review, 56(5), 455–459.
- Pólya, George (1945). How to Solve It. （発見はアルゴリズムでなくヒューリスティック）
- Von Neumann, John (1945). First Draft of a Report on the EDVAC. University of Pennsylvania.
- Shannon, Claude E. (1948). “A Mathematical Theory of Communication.” Bell System Technical Journal, 27, 379–423, 623–656.
- Weil, André (1949). “Numbers of solutions of equations in finite fields.” Bulletin of the American Mathematical Society, 55(5), 497–508.
1950–1969
- Callen, Herbert B., Welton, Theodore A. (1951). “Irreversibility and Generalized Noise.” Physical Review, 83(1), 34–40.
- Robinson, Julia (1952). “Existential Definability in Arithmetic.” Transactions of the American Mathematical Society, 72(3), 437–449.
- Davis, Martin (1953). “Arithmetical Problems and Recursively Enumerable Predicates.” Journal of Symbolic Logic, 18(1), 33–41.
- Simon, Herbert A. (1955). “A Behavioral Model of Rational Choice.” （Satisficingの原典補強）
- Newell, Allen, & Simon, Herbert A. (1956). “The Logic Theory Machine.” （人間の推論を探索問題として扱う）
- Simon, Herbert A. (1956). “Rational Choice and the Structure of the Environment.” （限定資源ノードとしての人間）
- Davis, Martin, Putnam, Hilary, Robinson, Julia (1961). “The Decision Problem for Exponential Diophantine Equations.” Annals of Mathematics, Second Series, 74(3), 425–436.
- Landauer, Rolf (1961). “Irreversibility and Heat Generation in the Computing Process.” IBM Journal of Research and Development, 5(3), 183–191.
- Kuhn, Thomas S. (1962). The Structure of Scientific Revolutions. （科学史は真理直列ではなくパラダイム遷移）
- Baran, Paul (1964). On Distributed Communications Networks. RAND Corporation Research Memorandum.
- Freyd, Peter J. (1964). Abelian Categories: An Introduction to the Theory of Functors. Harper & Row.
- Solomonoff, Ray J. (1964). “A Formal Theory of Inductive Inference.” （帰納・予測・圧縮の基礎）
- Kolmogorov, Andrey N. (1965). “Three approaches to the quantitative definition of information.” Problems of Information Transmission, 1(1), 1–7.PDF. （成功の最小記述不能性の補強）
- Baum, L. E., Petrie, T. (1966). “Statistical inference for probabilistic functions of finite state Markov chains.” The Annals of Mathematical Statistics, 37(6), 1554-1563.
- Chaitin, Gregory J. (1966). “On the Length of Programs for Computing Finite Binary Sequences.” （コルモゴロフ複雑性の補強）
- Leech, John (1967). “Notes on Sphere Packings.” Canadian Journal of Mathematics, 19, 251–267.
- Viterbi, A. J. (1967). “Error bounds for convolutional codes and an asymptotically optimum decoding algorithm.” IEEE Transactions on Information Theory, 13(2), 260-269.
1970–1989
- Baum, L. E., Petrie, T., Soules, G., Weiss, N. (1970). “A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains.” The Annals of Mathematical Statistics, 41(1), 164-171.
- Lakatos, Imre (1970). “Falsification and the Methodology of Scientific Research Programmes.” （研究プログラムとしての歴史）
- Matiyasevich, Yuri V. (1970). “Диофантовость перечислимых множеств.” (Enumerable sets are Diophantine). Doklady Akademii Nauk SSSR, 191, 279–282.
- Savitch, Walter J (1970). “Relationships between nondeterministic and deterministic tape complexities.” Journal of Computer and System Sciences, 4(2), 177–192. （非決定性空間 NPSPACE を決定性空間 PSPACE が二乗程度の増大で模擬できることの証明（NPSPACE = PSPACE）。空間による有限化。）
- Simon, Herbert A. (1970). “Human Problem Solving: The State of the Theory in 1970.” American Psychologist, 25(2), 145–159.
- Cook, Stephen A. (1971). “The complexity of theorem-proving procedures.” Proceedings of the 3rd Annual ACM Symposium on Theory of Computing (STOC), 151–158.
- Glansdorff, Paul, Prigogine, Ilya (1971). Thermodynamic Theory of Structure, Stability and Fluctuations. London: Wiley-Interscience. (See also: Prigogine, I. (1967). Thermodynamics of Irreversible Processes).
- PDF Reference
- May, J. Peter (1972). The Geometry of Iterated Loop Spaces. Lecture Notes in Mathematics, Vol. 271. Springer.
- Levin, Leonid A. (1973). “Universal search problems.” Problemy Peredachi Informatsii, 9(3), 115–116.
- Cerf, Vinton G., Kahn, Robert E. (1974). “A Protocol for Packet Network Intercommunication.” IEEE Transactions on Communications, 22(5), 637–648.
- Chaitin, Gregory J. (1974). “Information-Theoretic Computational Complexity.” IEEE Transactions on Information Theory, 20(1), 10–15.
- Deligne, Pierre (1974). “La conjecture de Weil. I.” Publications Mathématiques de l’IHÉS, 43, 273–307.
- Hopcroft, John, Tarjan, Robert (1974). “Efficient Planar Testing.” Journal of the ACM, 21(4), 549–568.
- Ladner, Richard E. (1975). “The Circuit Value Problem is Log Space Complete for P.” （P-completeの古典的基礎）
- Martin-Löf, Per (1975). “An Intuitionistic Theory of Types.” In Logic Colloquium ’73, edited by H. E. Rose and J. C. Shepherdson, 73–118. North-Holland.
- Bloor, David (1976). Knowledge and Social Imagery. （数学・科学知識の社会的構成性）
- Lakatos, Imre (1976). Proofs and Refutations. （証明が反例と修正の歴史的プロセスで進む根拠）
- Appel, Kenneth, Haken, Wolfgang (1977). “Every planar map is four colorable. Part I: Discharging.” Illinois Journal of Mathematics, 21(3), 429–490.
- Project Euclid
- Borodin, Allan (1977). “On Relating Time and Space to Size and Depth.” （深さ＝直列性の数理的補助線）
- Gill, John (1977). “Computational Complexity of Probabilistic Turing Machines.” SIAM Journal on Computing, 6(4), 675–695.Link. （増幅補題（誤り低減）の定式化と、片側誤り乱択クラス RP（当初 VPP）の導入。）
- Goldschlager, Leslie M. (1977). “The Monotone and Planar Circuit Value Problems are Log Space Complete for P.” （「歴史＝回路評価」の比喩を補強）
- Adleman, Leonard (1978). “Two theorems on random polynomial time.” Proceedings of the 19th Annual Symposium on Foundations of Computer Science (FOCS), 75–83. （乱択クラス RP（または BPP）が非一様多項式サイズ回路クラス P/poly に含まれることの存在的証明。脱ランダム化の基礎。）
- Cook, Stephen A., & Reckhow, Robert A. (1979). “The Relative Efficiency of Propositional Proof Systems.” （証明も計算資源を消費する、という主張の基礎）
- Garey, Michael R., Johnson, David S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co.
- Latour, Bruno, & Woolgar, Steve (1979). Laboratory Life. （科学的事実が社会的に生成・固定される視点）
- Pippenger, Nick (1979). “On Simultaneous Resource Bounds.” （時間・空間・並列性の制約）
- Howard, William A. (1980). “The formulae-as-types notion of construction.” In Essays on Combinatory Logic, Lambda Calculus and Formalisms, edited by J. P. Seldin and J. R. Hindley. Academic Press. (Circulated privately in 1969).
- Karp, Richard M., Lipton, Richard J (1980). “Some connections between non-uniform and uniform complexity classes.” Proceedings of the 12th Annual ACM Symposium on Theory of Computing (STOC), 302–309. （非一様仮定のもとで多項式階層が崩壊することの基礎。）
- Kline, Morris (1980). Mathematics: The Loss of Certainty. （数学の厳密性が歴史的構築物である補助線）
- Bennett, Charles H. (1982). “The Thermodynamics of Computation—A Review.” International Journal of Theoretical Physics, 21, 905–940.
- Karp, Richard M., Lipton, Richard J (1982). “Turing machines that take advice.” L'Enseignement Mathématique, 28(3-4), 191–209. （非一様性の形式化と、スラッシュ記法による複雑性クラス P/poly の明示的定義。）
- Lamport, Leslie, Shostak, Robert, Pease, Marshall (1982). “The Byzantine Generals Problem.” ACM Transactions on Programming Languages and Systems, 4(3), 382–401.
- Nelson, Richard R., & Winter, Sidney G. (1982). An Evolutionary Theory of Economic Change. （組織能力が履歴依存で蓄積される根拠）
- Sipser, Michael (1983). “A Complexity Theoretic Approach to Randomness.” Proceedings of the 15th Annual ACM Symposium on Theory of Computing (STOC), 330–335.
- Babai, László (1985). “Trading Group Theory for Randomness.” Proceedings of the 17th Annual ACM Symposium on Theory of Computing (STOC), 421–429.
- Cook, Stephen A. (1985). “A Taxonomy of Problems with Fast Parallel Algorithms.” （P-completeを「並列化困難な直列構造」として使う根拠）
- David, Paul A. (1985). “Clio and the Economics of QWERTY.” （歴史が合理性でなく経路で固定される代表文献）
- Gross, David J., Harvey, Jeffrey A., Martinec, Emil, Rohm, Ryan (1985). “Heterotic string theory (I). The free heterotic string.” Nuclear Physics Section B, 256, 253–284.
- Link
- Haken, Armin (1985). “The Intractability of Resolution.” （SAT / resolution / CDCL の背景）
- Razborov, Alexander A. (1985). “Lower Bounds for the Monotone Complexity of Some Boolean Functions.” （証明・回路の困難性）
- Shapin, Steven, & Schaffer, Simon (1985). Leviathan and the Air-Pump. （実験・証明・信頼の社会的形成）
- Arthur, W. Brian (1989). “Competing Technologies, Increasing Returns, and Lock-In by Historical Events.” （偶然の初期条件が歴史をロックインする根拠）
- Berners-Lee, Tim (1989). Information Management: A Proposal. CERN Research Memorandum.
- Goldwasser, Shafi, Micali, Silvio, Rackoff, Charles (1989). “The Knowledge Complexity of Interactive Proof-Systems.” SIAM Journal on Computing, 18(1), 186–208. (First presented at STOC 1985).
1990–1999
- North, Douglass C. (1990). Institutions, Institutional Change and Economic Performance. （制度史のP-complete的累積性）
- Babai, László, Fortnow, Lance, Lund, Carsten (1991). “Non-deterministic exponential time has two-prover interactive protocols.” Computational Complexity, 1(1), 3–40.
- Goldreich, Oded, Micali, Silvio, Wigderson, Avi (1991). “How to Prove All NP-Statements in Zero-Knowledge.” Journal of the ACM, 38(3), 690–728. (First presented at FOCS 1986).
- Link
- March, James G. (1991). “Exploration and Exploitation in Organizational Learning.” （探索と活用の直列トレードオフ）
- Arora, S., Safra, S. (1998 – 発表は1992年). “Probabilistic checkable proofs and pseudo-randomness.” Journal of the ACM, 45(1), 70-122.
- Lund, Carsten, Fortnow, Lance, Karloff, Howard, Nisan, Noam (1992). “Algebraic methods for interactive proof systems.” Journal of the ACM, 39(4), 859–864.
- Shamir, Adi (1992). “IP = PSPACE.” Journal of the ACM, 39(4), 865–877.
- Nisan, Noam, Wigderson, Avi (1994). “Hardness vs Randomness.” Journal of Computer and System Sciences, 49(2), 149–167.
- Greenlaw, Raymond, Hoover, H. James, & Ruzzo, Walter L. (1995). Limits to Parallel Computation: P-Completeness Theory. （P-complete全体の標準参照）
- Wiles, Andrew (1995). “Modular elliptic curves and Fermat’s Last Theorem.” Annals of Mathematics, 141(3), 443–551.
- Bernstein, Ethan, Vazirani, Umesh (1997). “Quantum Complexity Theory.” SIAM Journal on Computing, 26(5), 1411–1473. (First presented at STOC 1993; establishes BPP ⊆BQP⊆P#P).
- Impagliazzo, Russell, Wigderson, Avi (1997). “P = BPP unless E has sub-exponential circuits.” Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC), 220–229.
- Jarzynski, Christopher (1997). “A nonequilibrium equality for free energy differences.” Physical Review Letters, 78(14), 2690–2693.
- arXiv
- Robertson, Neil, Sanders, Daniel P., Seymour, Paul, Thomas, Robin (1997). “The four-color theorem.” Journal of Combinatorial Theory, Series B, 70(1), 2–44.
- PDF Reference
- Shor, Peter W. (1997). “Algorithms for quantum computation: discrete logarithms and factoring.” SIAM Journal on Computing, 26(5), 1484–1509. (First presented at FOCS 1994).
- PDF Reference
- Teece, David J., Pisano, Gary, & Shuen, Amy (1997). “Dynamic Capabilities and Strategic Management.” （企業能力が時間を通じて構築される理論）
- Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M. (1998). “Proof verification and the hardness of approximation problems.” Journal of the ACM, 45(3), 501-555.
- Arora, Sanjeev, Lund, Carsten, Motwani, Rajeev, Sudan, Madhu, Szegedy, Mario (1998). “Proof verification and the hardness of approximation problems.” Journal of the ACM, 45(3), 501–555. (The PCP Theorem: NP = PCP(log n, 1)).
- Arora, Sanjeev, Safra, Shmuel (1998). “Probabilistic checking of proofs: A new characterization of NP.” Journal of the ACM, 45(1), 70–122.
- Hales, Thomas C. (1998). “An Overview of the Kepler Conjecture.” arXiv preprint math/9811071.
- arXiv
- Impagliazzo, Russell, Wigderson, Avi (1998). “Randomness vs Time: De-randomization under a uniform assumption.” Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 734–743.
2000–2009
- Breuil, Christophe, Conrad, Brian, Diamond, Fred, Taylor, Richard (2001). “On the modularity of elliptic curves over $\mathbb{Q}$: wild 3-adic exercises.” Journal of the American Mathematical Society, 14(4), 843–939.
- Håstad, Johan (2001). “Some Optimal Inapproximability Results.” Journal of the ACM, 48(4), 798–859. (First presented at STOC 1997; demonstrates PCP bounds ($1-\epsilon, 1/2+\epsilon$)).
- Janzing, Dominik, Wocjan, Pawel, Beth, Thomas (2002). “Identity of d-level Cluster States and the Quantum Complexity of Non-Abelian Orbit Problems.” arXiv preprint quant-ph/0605181v2.
- arXiv
- Perelman, Grigori (2002). “The entropy formula for the Ricci flow and its geometric applications.” arXiv preprint math/0211159.
- arXiv
- Miltersen, Peter Bro, Vinodchandran, N. V. (2005). “Derandomizing Arthur-Merlin Games using Small-Space Generators.” Computational Complexity, 14(3), 262–281. (First appeared in BRICS Report 1999).
- PDF Reference
- Shaltiel, Ronen, Umans, Christopher (2005). “Simple extractor constructions and many-output pseudorandom generators.” Journal of the ACM, 52(6), 920–951.
- Aharonov, Dorit, Jones, Vaughan, Landau, Zephph (2006). “A Polynomial Quantum Algorithm for Approximating the Jones Polynomial.” arXiv preprint quant-ph/0511096.
- arXiv
- Adams, Jeffrey, et al. (Atlas of Lie Groups and Representations Project) (2007). “The Character Table of $E_8$.” Notices of the AMS, 54(9). (Work by Fokko du Cloux et al.).
- Gutfreund, Dan, Shaltiel, Ronen, Ta-Shma, Amnon (2007). “Uniform Hardness versus Randomness Tradeoffs for Arthur-Merlin Games.” Computational Complexity, 16(4), 363–410. (First appeared in 2003).
- Lisi, Antony Garrett (2007). “An Exceptionally Simple Theory of Everything.” arXiv preprint arXiv:0711.0770.
- arXiv
- Gonthier, Georges (2008). “A computer-checked proof of the Four Colour Theorem.” Microsoft Research / INRIA Joint Laboratory Report.
2010–
- Coldea, Radu, et al. (2010). “Quantum Criticality in an Ising Chain: Experimental Evidence for $E_8$ Symmetry.” Science, 327(5962), 177–180.
- arXiv Preprint 2011
- Aaronson, Scott (2011). “BQP and the Polynomial Hierarchy.” Proceedings of the 43rd Annual ACM Symposium on Theory of Computing (STOC), 647–656. (ArXiv preprint 2009).
- arXiv
- Arvind, V., Gopal, Rohit, Joglekar, Pushkar S., Kulkarni, Sreejith (2011). “Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds.” STACS 2011.
- PDF Reference
- Voevodsky, Vladimir (The Univalent Foundations Program) (2013). Homotopy Type Theory: Univalent Foundations of Mathematics. Institute for Advanced Study.
- Hohm, Olaf, Samtleben, Henning (2014). “Exceptional Field Theory. III. $E_8$.” Physical Review D, 89(6), 066017.
- arXiv
- Cohn, Henry, Kumar, Abhinav, Miller, Stephen D., Radchenko, Danylo, Viazovska, Maryn (2017). “The sphere packing problem in dimension 24.” Annals of Mathematics, 185(3), 1017–1033.
- arXiv
- Lurie, Jacob (2017). Higher Topos Theory (AM-170). Princeton University Press.
- PDF Reference
- Raz, Ran, Tal, Avishay (2019). “Oracle Separation of BQP and PH.” Journal of the ACM, 66(3), 1–40. (First presented at STOC 2019).
- Wigderson, Avi (2019). Mathematics and Computation: A Theory Revolutionizing Technology and Science. Princeton University Press.
- PDF (Online Version)
- Font, Anamaría, Fraiman, Bernardo, Graña, Mariana, Núñez, Carmen A. (2020). “Exploring the landscape of heterotic strings on $T^d$.” Journal of High Energy Physics (JHEP), 2020, 219.
- arXiv
- Ji, Zhengfeng, Natarajan, Anand, Vidick, Thomas, Wright, John, Yuen, Henry (2021). “MIP* = RE.” Communications of the ACM, 64(11), 131–138. (ArXiv preprint 2020).
- arXiv
- Melkebeek, Dieter van, Sdroievski, Nicollas Mocelin (2023). “Instance-Wise Hardness versus Randomness Tradeoffs for Arthur-Merlin Protocols.” CCC 2023.
- Melkebeek, Dieter van, Sdroievski, Nicollas Mocelin (2023). “Leakage Resilience, Targeted Pseudorandom Generators, and Mild Derandomization of Arthur-Merlin Protocols.” FSTTCS 2023.
- Coldea, Radu, et al. (2010). “Quantum Criticality in an Ising Chain: Experimental Evidence for $E_8$ Symmetry.” Science, 327(5962), 177–180.
- Breuil, Christophe, Conrad, Brian, Diamond, Fred, Taylor, Richard (2001). “On the modularity of elliptic curves over $\mathbb{Q}$: wild 3-adic exercises.” Journal of the American Mathematical Society, 14(4), 843–939.
- Callen, Herbert B., Welton, Theodore A. (1951). “Irreversibility and Generalized Noise.” Physical Review, 83(1), 34–40.
- Hilbert, David (1900). “Mathematical Problems.” Lecture delivered before the International Congress of Mathematicians at Paris.