Search results

Jump to navigation Jump to search
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • ...asoning |chapter=Gödel Logics – A Survey |series=Lecture Notes in Computer Science |date=2010 |volume=6397 |pages=30–51 |doi=10.1007/978-3-642-16242-8_4 |isbn In 1959, [[Michael Dummett]] showed that infinite-valued [[propositional logic|prop ...
    2 KB (316 words) - 14:25, 19 September 2024
  • {{short description|Length scale used in fluid dynamics}} ...dynamics]], the '''Batchelor scale''', determined by [[George Batchelor]] (1959),<ref>{{Citation ...
    2 KB (307 words) - 05:16, 17 October 2024
  • ...is the weight and '''x''' is the value of the ''jth'' asset to be included in the portfolio. ...ance and W. W. Cooper (1959), "Chance-Constrained Programming," Management Science, 6, No. 1, 73-79. [https://www.jstor.org/stable/2627476?Search=yes&resultIt ...
    5 KB (686 words) - 09:37, 15 August 2024
  • ...is used to compare overlap among [[Sample (statistics)|samples]] (Morisita 1959). This formula is based on the assumption that increasing the size of the : ''x''<sub>''i''</sub> is the number of times species ''i'' is represented in the total ''X'' from one sample. ...
    3 KB (399 words) - 11:33, 15 November 2024
  • ...science]], the '''sorting numbers''' are a sequence of numbers introduced in 1950 by [[Hugo Steinhaus]] for the analysis of [[comparison sort]] algorith ...math> items using any [[comparison sort]]. The conjecture was disproved in 1959 by [[L. R. Ford Jr.]] and [[Selmer M. Johnson]], who found a different sort ...
    4 KB (483 words) - 22:56, 12 December 2024
  • ...tor2-first=D.}}</ref> about representing a given [[context-free language]] in terms of two simpler languages. These two simpler languages, namely a [[reg The theorem Proofs of this theorem are found in several textbooks, e.g. {{harvtxt|Autebert|Berstel|Boasson|1997}} or {{harv ...
    4 KB (626 words) - 10:28, 10 October 2024
  • ...on]] for a reactive structure that builds up charge (positive or negative) in its [[transition state]]. The Yukawa–Tsuno equation can take the following ...>&minus;</sup>}} represent the Hammett substituent constants for reactions in which positive or negative charges are built up at the reactive center, res ...
    6 KB (928 words) - 04:05, 16 June 2023
  • {{Short description|South Korean mathematician (born 1959)}} | work_institutions = [[Pohang University of Science and Technology]] ...
    8 KB (1,016 words) - 12:32, 7 February 2025
  • ...ess-date=8 August 2021 |language=en}}</ref> The compound does not dissolve in water, forms a crystalline hydrate with yellow crystals.<ref>{{cite web |ti Also a reaction of samarium nitrate and oxalic acid in an aqueous solution: ...
    4 KB (525 words) - 12:28, 3 January 2024
  • ...ges that allow a function to call itself recursively |Recursion (computer science)}} ...the language and halts and rejects it otherwise. In [[theoretical computer science]], such always-halting Turing machines are called [[total Turing machine]]s ...
    7 KB (928 words) - 20:02, 6 February 2025
  • ...ed graph]] with 12 vertices and 24 edges, discovered by [[Václav Chvátal]] in 1970. It is the smallest graph that is [[triangle-free graph|triangle-free] ...exist <math>k</math>-chromatic graphs with girth <math>\ell</math>.{{r|e}} In connection with these two results and several examples including the Chváta ...
    7 KB (934 words) - 08:51, 18 July 2024
  • ...>r+1</math>, so it is equivalent to define paving matroids as the matroids in which the size of every circuit belongs to the set <math>\{r,r+1\}</math>.< ...math> distinct elements of <math>S</math> are contained in exactly one set in <math>\mathcal{D}</math>. The elements of <math>\mathcal{D}</math> form a ...
    7 KB (1,020 words) - 08:01, 11 November 2024
  • ...de''' such as '''Zatocoding''' is a kind of [[hash code]] that was popular in [[Edge-notched card|marginal punched-card systems]]. Every card in a stack had the same set of pre-punched holes. ...
    9 KB (1,488 words) - 10:16, 22 June 2024
  • ...io/|title=Researchers from around the world discuss gender and mathematics in Rio|work=[[Exame]]|date=31 July 2018|accessdate=30 August 2018}}</ref> and ...4 February 1921, to Tullio de Saboia Chaves and Zillah da Costa Magalhaes, in [[Santana do Livramento]]. She had two siblings, Lúcia de Magalhaes Chaves ...
    7 KB (1,042 words) - 12:58, 16 October 2024
  • ...Although not of practical significance, it remains of theoretical interest in connection with the problem of sorting with a minimum number of comparisons ...order. The steps listed here reverse the output, following the description in {{harvtxt|Knuth|1998}}. The resulting algorithm makes the same comparisons ...
    11 KB (1,721 words) - 16:17, 30 October 2024
  • ...link=Ilya Piatetski-Shapiro|last=Piatetski-Shapiro|year1=1959|year2=1969}} in his study of bounded homogeneous domains. :<math>\Im(z)\in V \, </math> ...
    8 KB (1,178 words) - 21:32, 11 November 2024
  • {{Short description|Algebraic structure in network theory}} ...ume=93|pages=114–131|mr=0109161|doi=10.1090/s0002-9947-1959-0109161-6|year=1959|last1=Duffin|first1=R. J.|author-link=Richard Duffin|doi-access=free}}</ref ...
    5 KB (761 words) - 07:13, 5 May 2024
  • ...stress]] in already [[Ductility|ductile]] metals, to promoting plasticity in otherwise brittle [[Ceramic|ceramics]]. The exact mechanisms that control e ...affect [[Electron|electrons]] which dictate the [[Chemical bond|bonding]] in materials and therefore all higher level phenomena such as dislocation moti ...
    7 KB (977 words) - 21:56, 7 November 2024
  • ...aschütz: Life and Work|year=2018|volume=5|pages=125–138|journal=[[Advances in Group Theory and Applications]]|url=https://web.archive.org/web/20201124222 ...y of Chicago]] 1968); and in Australia ([[Australian National University]] in Canberra).<ref name=Kiel/> ...
    9 KB (1,235 words) - 09:19, 7 January 2025
  • ...sue=6 |pages=930–945 |doi=10.1287/opre.13.6.930}}</ref> CCP is widely used in various fields, including [[finance]], [[engineering]], and [[operations re ...ves the use of [[probability]] and confidence levels to handle uncertainty in optimization problems. It distinguishes between single and joint chance con ...
    6 KB (746 words) - 07:24, 15 December 2024
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)