• Thumbnail for Problem solving
     383–395. ISBN 978-1-317-78386-2. Hussy, W. (1985). "Komplexes Problemlösen—Eine Sackgasse?" [Complex problem solving—a dead end?]. Zeitschrift für Experimentelle...
    85 KB (9,991 words) - 15:15, 29 May 2024
  • Thumbnail for Egbert van Kampen
    succumbed to cancer and died on 11 February 1942. van Kampen, E. R. (1933). "Komplexe in euklidischen Räumen". Abhandlungen aus dem Mathematischen Seminar der...
    6 KB (545 words) - 17:49, 17 May 2022
  • Thumbnail for Georg Hamel
    lines are the shortest", Hamel's doctoral dissertation on Hilbert's fourth problem. A version may be found in Mathematische Annalen 57, 1903.) Lagrange-Euler'schen...
    7 KB (466 words) - 11:21, 13 June 2024
  • Thumbnail for Carl Friedrich Gauss
    "Arithmetisch-geometrisches Mittel und elliptische Integrale: Gauß und die komplexe Analysis". In Mittler, Elmar (ed.). "Wie der Blitz einschlägt, hat sich...
    199 KB (20,128 words) - 17:12, 15 June 2024
  • Thumbnail for BODIPY
    PMID 19572588. Alfred Treibs und Franz-Heinrich Kreuzer. Difluorboryl-Komplexe von Di- und Tripyrrylmethenen. Justus Liebigs Annalen der Chemie 1968,...
    19 KB (1,940 words) - 03:15, 6 April 2024
  • Thumbnail for Hadwiger number
    follows that determining the Hadwiger number is NP-hard. However, the problem is fixed-parameter tractable: there is an algorithm for finding the largest...
    11 KB (1,231 words) - 15:50, 2 July 2023
  • is sometimes used to emphasize one method of viewing and dealing with a problem over another. The mathematics of trigonometry and exponentials are related...
    25 KB (2,365 words) - 06:46, 13 May 2024
  • Published in June 2019. Tobias Winter, the only apprentice in the "Abteilung komplexe und diffuse Angelegenheiten" (KDA) (Department for Complex and Diffuse...
    28 KB (2,383 words) - 08:49, 31 May 2024
  • Thumbnail for Hadwiger conjecture (graph theory)
    Hadwiger conjecture (graph theory) (category Unsolved problems in graph theory)
    Unsolved problem in mathematics: Does every graph with chromatic number k {\displaystyle k} have a k {\displaystyle k} -vertex complete graph as a minor...
    19 KB (2,401 words) - 20:54, 27 March 2024
  • Thumbnail for Möbius ladder
    facets of the polytope describing a linear programming relaxation of the problem; these facets are called Möbius ladder constraints. Ladder graph Prism...
    15 KB (1,383 words) - 23:18, 26 April 2024