Source ledger
References
837 bibliography records ground the catalog in original papers, established surveys and monographs, institutional problem lists, and formal-proof archives.
Complete bibliography
837 records
- GorskySteinerWiederrecht2022BarnetteOpen source ↗
Matching theory and Barnette's conjecture
Maximilian Gorsky and Raphael Steiner and Sebastian Wiederrecht · 2023 · misc
Maximilian Gorsky, Raphael Steiner, and Sebastian Wiederrecht, “Matching theory and Barnette's conjecture,” Discrete Mathematics 346 (2023), Article 113249, DOI: 10.1016/j.disc.2022.113249, https://arxiv.org/abs/2202.11641.
- GreenlawHooverRuzzo1995Open source ↗
Limits to Parallel Computation: P-Completeness Theory
Raymond Greenlaw and H. James Hoover and Walter L. Ruzzo · 1995 · misc
Raymond Greenlaw, H. James Hoover, and Walter L. Ruzzo, Limits to Parallel Computation: P-Completeness Theory, Oxford University Press (1995), https://www.cs.cornell.edu/courses/cs5220/2014fa/PCom.pdf.
- GroheNeuen2021GIOpen source ↗
Recent advances on the graph isomorphism problem
Martin Grohe and Daniel Neuen · 2021 · misc
Martin Grohe and Daniel Neuen, “Recent advances on the graph isomorphism problem,” arXiv:2011.01366 (2021), https://arxiv.org/abs/2011.01366.
- GronlundPettie2014ThreeSUMOpen source ↗
Threesomes, degenerates, and love triangles
Allan Grønlund and Seth Pettie · 2014 · misc
Allan Grønlund and Seth Pettie, “Threesomes, degenerates, and love triangles,” Proceedings of FOCS 2014, 621–630, DOI: 10.1109/FOCS.2014.72.
- GuthKatz2015DistancesOpen source ↗
On the Erdős distinct distances problem in the plane
Larry Guth and Nets Hawk Katz · 2015 · misc
Larry Guth and Nets Hawk Katz, “On the Erdős distinct distances problem in the plane,” Annals of Mathematics 181 (2015), 155–190, DOI: 10.4007/annals.2015.181.1.2.
- Guy1960Crossing
A combinatorial problem
Richard K. Guy · 1960 · misc
Richard K. Guy, “A combinatorial problem,” Nabla (Bulletin of the Malayan Mathematical Society) 7 (1960), 68–72.
- Guy1972CrossingOpen source ↗
Crossing numbers of graphs
Richard K. Guy · 1972 · misc
Richard K. Guy, “Crossing numbers of graphs,” in Graph Theory and Applications, Lecture Notes in Mathematics 303, Springer (1972), 111–124, DOI: 10.1007/BFb0067363.
- Hadamard1893Open source ↗
Résolution d'une question relative aux déterminants
Jacques Hadamard · 1893 · misc
Jacques Hadamard, “Résolution d'une question relative aux déterminants,” Bulletin des Sciences Mathématiques 17 (1893), 240–246, https://gallica.bnf.fr/ark:/12148/bpt6k3074r/f246.item
- Hadwiger1943
Über eine Klassifikation der Streckenkomplexe
Hugo Hadwiger · 1943 · misc
Hugo Hadwiger, “Über eine Klassifikation der Streckenkomplexe,” Vierteljahrsschrift der Naturforschenden Gesellschaft in Zürich 88 (1943), 133–142.
- Hadwiger1950NelsonOpen source ↗
Überdeckung des euklidischen Raumes durch kongruente Mengen
Hugo Hadwiger · 1945 · misc
Hugo Hadwiger, “Überdeckung des euklidischen Raumes durch kongruente Mengen,” Portugaliae Mathematica 4 (1945), 238–242, http://www.numdam.org/item/PM_1945__4__238_0/
- Hadwiger1957Illumination
Ungeloeste Probleme Nr. 20
Hugo Hadwiger · 1957 · misc
Hugo Hadwiger, “Ungeloeste Probleme Nr. 20,” Elemente der Mathematik 12 (1957), 121.
- Hales2011ReinhardtOpen source ↗
On the Reinhardt conjecture
Thomas C. Hales · 2011 · misc
Thomas C. Hales, “On the Reinhardt conjecture,” arXiv:1103.4518 (2011), https://arxiv.org/abs/1103.4518.
- HalesVajjha2024SmoothedOpen source ↗
Packings of smoothed polygons
Thomas C. Hales and Koundinya Vajjha · 2024 · misc
Thomas C. Hales and Koundinya Vajjha, “Packings of smoothed polygons,” arXiv:2405.04331 (2024), https://arxiv.org/abs/2405.04331.
- Haxell1999TuzaOpen source ↗
Packing and covering triangles in graphs
Penny Haxell · 1999 · misc
Penny Haxell, “Packing and covering triangles in graphs,” Discrete Mathematics 195 (1999), 251–254, DOI: 10.1016/S0012-365X(98)00183-6.
- HaxellScott2021RyserOpen source ↗
On Ryser's conjecture
Penny E. Haxell and Alex Scott · 2021 · misc
Penny E. Haxell and Alex Scott, “On Ryser's conjecture,” Electronic Journal of Combinatorics 28 (2021), Paper P4.37, https://www.combinatorics.org/ojs/index.php/eljc/article/view/v28i4p37.
- HedayatSloaneStufken1999Open source ↗
Orthogonal Arrays: Theory and Applications
A. S. Hedayat and N. J. A. Sloane and John Stufken · 1999 · misc
A. S. Hedayat, N. J. A. Sloane, and John Stufken, Orthogonal Arrays: Theory and Applications, Springer (1999), DOI: 10.1007/978-1-4612-1478-6.
- Hirahara2020MCSPOpen source ↗
Non-black-box worst-case to average-case reductions within NP
Shuichi Hirahara · 2018 · misc
Shuichi Hirahara, “Non-black-box worst-case to average-case reductions within NP,” Proceedings of FOCS 2018, 247–258, DOI: 10.1109/FOCS.2018.00032.
- IAS2026UniqueGamesOpen source ↗
The limits of close enough: Unique Games
Institute for Advanced Study · 2026 · misc
Institute for Advanced Study, “The limits of close enough: Unique Games,” 2026, https://www.ias.edu/ideas/limits-close-enough.
- Immerman1988Open source ↗
Nondeterministic space is closed under complementation
Neil Immerman · 1988 · misc
Neil Immerman, “Nondeterministic space is closed under complementation,” SIAM Journal on Computing 17 (1988), 935–938, DOI: 10.1137/0217058.
- ImpagliazzoLuby1989Open source ↗
One-way functions are essential for complexity based cryptography
Russell Impagliazzo and Michael Luby · 1989 · misc
Russell Impagliazzo and Michael Luby, “One-way functions are essential for complexity based cryptography,” Proceedings of FOCS 1989, 230–235, DOI: 10.1109/SFCS.1989.63483.
- ImpagliazzoPaturi2001ETHOpen source ↗
On the complexity of k-SAT
Russell Impagliazzo and Ramamohan Paturi · 2001 · misc
Russell Impagliazzo and Ramamohan Paturi, “On the complexity of k-SAT,” Journal of Computer and System Sciences 62 (2001), 367–375, DOI: 10.1006/jcss.2000.1727.
- ImpagliazzoPaturiZane2001Open source ↗
Which problems have strongly exponential complexity?
Russell Impagliazzo and Ramamohan Paturi and Francis Zane · 2001 · misc
Russell Impagliazzo, Ramamohan Paturi, and Francis Zane, “Which problems have strongly exponential complexity?” Journal of Computer and System Sciences 63 (2001), 512–530, DOI: 10.1006/jcss.2001.1774.
- ImpagliazzoWigderson1997Open source ↗
P=BPP if E requires exponential circuits
Russell Impagliazzo and Avi Wigderson · 1997 · misc
Russell Impagliazzo and Avi Wigderson, “P=BPP if E requires exponential circuits,” Proceedings of STOC 1997, 220–229, DOI: 10.1145/258533.258590.
- Jerrum1992CliqueOpen source ↗
Large cliques elude the Metropolis process
Mark Jerrum · 1992 · misc
Mark Jerrum, “Large cliques elude the Metropolis process,” Random Structures \& Algorithms 3 (1992), 347–359, DOI: 10.1002/rsa.3240030402.
- KabanetsImpagliazzo2004Open source ↗
Derandomizing polynomial identity tests means proving circuit lower bounds
Valentine Kabanets and Russell Impagliazzo · 2004 · misc
Valentine Kabanets and Russell Impagliazzo, “Derandomizing polynomial identity tests means proving circuit lower bounds,” Computational Complexity 13 (2004), 1–46, DOI: 10.1007/s00037-004-0182-6.
- Kahn1996AsymptoticListOpen source ↗
Asymptotics of the list-chromatic index for multigraphs
Jeff Kahn · 2000 · misc
Jeff Kahn, “Asymptotics of the list-chromatic index for multigraphs,” Random Structures \& Algorithms 17 (2000), 117–156, DOI: 10.1002/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9.
- KahnKalai1993BorsukOpen source ↗
A counterexample to Borsuk's conjecture
Jeff Kahn and Gil Kalai · 1993 · misc
Jeff Kahn and Gil Kalai, “A counterexample to Borsuk's conjecture,” Bulletin of the American Mathematical Society 29 (1993), 60–62, DOI: 10.1090/S0273-0979-1993-00398-7.
- KahnSaksSturtevant1984Open source ↗
A topological approach to evasiveness
Jeff Kahn and Michael Saks and Dean Sturtevant · 1984 · misc
Jeff Kahn, Michael Saks, and Dean Sturtevant, “A topological approach to evasiveness,” Combinatorica 4 (1984), 297–306, DOI: 10.1007/BF02579140.
- Kalai1989CSOpen source ↗
The number of faces of centrally-symmetric polytopes
Gil Kalai · 1989 · misc
Gil Kalai, “The number of faces of centrally-symmetric polytopes,” Graphs and Combinatorics 5 (1989), 389–391, DOI: 10.1007/BF01788696.
- KangEtAl2023EFLOpen source ↗
A proof of the Erdős–Faber–Lovász conjecture for large graphs
Dong Yeap Kang and Tom Kelly and Daniela Kühn and Abhishek Methuku and Deryk Osthus · 2023 · misc
Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, and Deryk Osthus, “A proof of the Erdős–Faber–Lovász conjecture for large graphs,” Annals of Mathematics 198 (2023), 537–618, DOI: 10.4007/annals.2023.198.2.2.
- Karp1972Open source ↗
Reducibility among combinatorial problems
Richard M. Karp · 2001 · misc
Richard M. Karp, “Reducibility among combinatorial problems,” in Complexity of Computer Computations, Plenum (1972), 85–103, DOI: 10.1007/978-1-4684-2001-2_9.
- KarpLipton1980Open source ↗
Some connections between nonuniform and uniform complexity classes
Richard M. Karp and Richard J. Lipton · 1980 · misc
Richard M. Karp and Richard J. Lipton, “Some connections between nonuniform and uniform complexity classes,” Proceedings of STOC 1980, 302–309, DOI: 10.1145/800141.804678.
- Keevash2011HypergraphTuranOpen source ↗
Hypergraph Turán problems
Peter Keevash · 2011 · misc
Peter Keevash, “Hypergraph Turán problems,” in Surveys in Combinatorics 2011, London Mathematical Society Lecture Note Series 392, Cambridge University Press, 83–140, DOI: 10.1017/CBO9781139004114.004, https://people.maths.ox.ac.uk/keevash/papers/turan-survey.pdf.
- KharaghaniTayfehRezaie2005Open source ↗
A Hadamard matrix of order 428
Hadi Kharaghani and Behruz Tayfeh-Rezaie · 2005 · misc
Hadi Kharaghani and Behruz Tayfeh-Rezaie, “A Hadamard matrix of order 428,” Journal of Combinatorial Designs 13 (2005), 435–440, DOI: 10.1002/jcd.20043.
- Khot2002UGCOpen source ↗
On the power of unique 2-prover 1-round games
Subhash Khot · 2002 · misc
Subhash Khot, “On the power of unique 2-prover 1-round games,” Proceedings of STOC 2002, 767–775, DOI: 10.1145/509907.510017.
- KingReed2014Open source ↗
Bounding \chi in terms of \omega and \Delta
Andrew D. King and Bruce Reed · 2008 · misc
Andrew D. King and Bruce Reed, “Bounding \chi in terms of \omega and \Delta,” Journal of Graph Theory 59 (2008), 215–228, DOI: 10.1002/jgt.20323.
- KirchwegerPeitlSzeider2023EFLOpen source ↗
A SAT Solver's Opinion on the Erdős–Faber–Lovász Conjecture
Markus Kirchweger and Tomáš Peitl and Stefan Szeider · 2023 · misc
Markus Kirchweger, Tomáš Peitl, and Stefan Szeider, “A SAT Solver's Opinion on the Erdős–Faber–Lovász Conjecture,” LIPIcs SAT 2023 271 (2023), 13:1–13:17, DOI: 10.4230/LIPIcs.SAT.2023.13, https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2023.13.
- KopelowitzPettiePorat2016Open source ↗
Higher lower bounds from the 3SUM conjecture
Tsvi Kopelowitz and Seth Pettie and Ely Porat · 2016 · misc
Tsvi Kopelowitz, Seth Pettie, and Ely Porat, “Higher lower bounds from the 3SUM conjecture,” Proceedings of SODA 2016, 1272–1287, DOI: 10.1137/1.9781611974331.ch89.
- Lam1991Plane10Open source ↗
The search for a finite projective plane of order 10
Clement W. H. Lam · 1991 · misc
Clement W. H. Lam, “The search for a finite projective plane of order 10,” American Mathematical Monthly 98 (1991), 305–318, DOI: 10.1080/00029890.1991.12000759.
- Lebesgue1914Universal
Sur quelques questions de minimum, relatives aux courbes orbiformes, et sur leurs rapports avec le calcul des variations
Henri Lebesgue · 1914 · misc
Henri Lebesgue, “Sur quelques questions de minimum, relatives aux courbes orbiformes, et sur leurs rapports avec le calcul des variations,” Journal de Mathématiques Pures et Appliquées 4 (1914), 67–96.
- Lenstra2000FactoringOpen source ↗
Integer factoring
Arjen K. Lenstra · 2000 · misc
Arjen K. Lenstra, “Integer factoring,” Designs, Codes and Cryptography 19 (2000), 101–128, DOI: 10.1023/A:1008397921377.
- LiuMontgomery2023CyclesOpen source ↗
A proof of Mader's conjecture on large clique subdivisions in C_4-free graphs
Hong Liu and Richard Montgomery · 2023 · misc
Hong Liu and Richard Montgomery, “A proof of Mader's conjecture on large clique subdivisions in C_4-free graphs,” and related cycle consequences, Journal of the American Mathematical Society 36 (2023), https://doi.org/10.1090/jams/1000.
- LokshtanovMarxSaurabh2011Open source ↗
Lower bounds based on the Exponential Time Hypothesis
Daniel Lokshtanov and Dániel Marx and Saket Saurabh · 2011 · misc
Daniel Lokshtanov, Dániel Marx, and Saket Saurabh, “Lower bounds based on the Exponential Time Hypothesis,” Bulletin of the EATCS 105 (2011), 41–72, https://eatcs.org/beatcs/index.php/beatcs/article/view/92.
- LovaszSaks1988LogRankOpen source ↗
Lattices, Möbius functions and communications complexity
László Lovász and Michael Saks · 1988 · misc
László Lovász and Michael Saks, “Lattices, Möbius functions and communications complexity,” Proceedings of FOCS 1988, 81–90, DOI: 10.1109/SFCS.1988.21924.
- Lovett2014SurveyOpen source ↗
Recent advances on the log-rank conjecture in communication complexity
Shachar Lovett · 2014 · misc
Shachar Lovett, “Recent advances on the log-rank conjecture in communication complexity,” arXiv:1403.8106 (2014), https://arxiv.org/abs/1403.8106.
- Lovett2016LogRankOpen source ↗
Communication is bounded by root of rank
Shachar Lovett · 2016 · misc
Shachar Lovett, “Communication is bounded by root of rank,” Journal of the ACM 63 (2016), Article 1, DOI: 10.1145/2724704.
- Mahaney1982SparseOpen source ↗
Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis
Stephen R. Mahaney · 1982 · misc
Stephen R. Mahaney, “Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis,” Journal of Computer and System Sciences 25 (1982), 130–143, DOI: 10.1016/0022-0000(82)90002-2.
- Mahler1939
Ein Minimalproblem für konvexe Polygone
Kurt Mahler · 1939 · misc
Kurt Mahler, “Ein Minimalproblem für konvexe Polygone,” Mathematica (Zutphen) B 7 (1939), 118–127.