Search results

...hey appear in the [[Moscow Mathematical Papyrus]] (MMP) and in the [[Rhind Mathematical Papyrus]] (RMP), among others.<ref name="Clagett">{{cite book |last=Clagett ...n multiple|(least) common multiples]] to turn problems with fractions into problems using integers. The multiplicative factors were often recorded in red ink a ...

...For theories in [[classical logic]], this means that for every [[Sentence (mathematical logic)|sentence]], the theory contains either the sentence or its negation | title = A mathematical introduction to logic ...

...onsymmetric conic optimization |date=2006}}</ref> It is a [[generalization#Mathematical generalizations|generalization]] of the [[quadratic cone]]: the quadratic c The ''n''-dimensional power cone is [[Parameter#Mathematical functions|parameterized]] by a [[real number]] <math>0<r<1</math>. It is d ...

==Mathematical formulations== ...formatik.uni-osnabrueck.de/knust/class/ "Complexity results for scheduling problems"], [[University of Osnabrueck]]</ref> ...

...e graph property has a sharp threshold|journal=Proceedings of the American Mathematical Society|volume=124|issue=10|year=1996|pages=2993–3002|doi=10.1090/s0002-993 * [http://unsolvedproblems.org/ Unsolved Problems in Number Theory, Logic and Cryptography] ...

...accurate mathematical representation of real-world nonlinear optimization problems. [[Category:Mathematical optimization]] ...

{{about|[[mathematical programming]]||Complementarity (disambiguation)}} ...lups | first1=Stephen | last2=Murty | first2=Katta | title=Complementarity Problems | doi=10.1016/S0377-0427(00)00432-5|url=http://www-personal.umich.edu/~murt ...

In [[mathematical analysis]], '''epi-convergence''' is a type of convergence for [[real-value ...of [[#Hypo-convergence|hypo-convergence]] is appropriate for maximization problems. [[Mosco convergence]] is a generalization of epi-convergence to infinite d ...

In [[mathematical optimization]], the '''network simplex algorithm''' is a [[graph theory|gra ...trees via euler tours, applied to the network simplex algorithm|journal = Mathematical Programming|date = 1997-08-01|issn = 0025-5610|pages = 169–177|volume = 78| ...

The '''United States of America Mathematical Talent Search''' ('''USAMTS''') is a [[mathematics competition]] open to al ...through the USAMTS website. During this time, students are free to use any mathematical resources that are available, so long as it is not the help of another pers ...

* V. A. Kozlov, V.G. Maz'ya, J. Rossmann, "Elliptic boundary value problems in domains with point singularities", Amer. Math. Soc. (1997) [https://www. ...lepko, D.G. Orlovsky, I.A. Vasin, "Methods for solving inverse problems in mathematical physics", M. Dekker (2000) [https://www.ams.org/mathscinet-getitem?mr=17482 ...

...[[population dynamics]], [[quantum mechanics]], [[crystallography]], and [[mathematical finance]].{{r|austms|witwa}} She is a professor in the School of Physics, M ...dissertation, ''Concentration phenomena for singularly perturbed elliptic problems and related topics'', was supervised by [[Andrea Malchiodi]].{{r|mg}} ...

'''[[BQP]]''' is a computational complexity class that represents problems that are easy to solve for quantum computers. * <math>BQP</math>, a mathematical object that can be used to define [[algebraic K-theory]] ...

{{short description|Set of 36 mathematics problems posed by Yutaka Taniyama}} ...n | last=Mazur|first=B.|title=Number Theory as Gadfly|journal=The American Mathematical Monthly|volume=98|number=7|pages=593–610|year=1991}}</ref><ref name="Lang"> ...

'''Kolchin's problems''' are a set of unsolved problems in [[differential algebra]], outlined by [[Ellis Kolchin]] at the [[Interna ...riel|last=Rosenfeld|date=May 26, 1959|journal=Transactions of the American Mathematical Society|volume=90|issue=3|pages=394–407|via=www.ams.org|doi=10.1090/S0002-9 ...

This is one of [[Kolchin's Problems]]. A [[mathematical proof]] of the inequality has been open since 1936. ...

...and optimization with biconvex functions: a survey and extensions|journal=Mathematical Methods of Operations Research|date=22 June 2007|volume=66|issue=3|pages=37 |title="The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent" ...

'''Basis pursuit''' is the [[mathematical optimization]] problem of the form ...ming]] problems in polynomial time and vice versa, making the two types of problems polynomially equivalent.<ref name="Tillmann">A. M. Tillmann ''[https://onli ...

...d after [[Brian Alspach]], who posed it as a research problem in 1981. A [[mathematical proof|proof]] was published by {{harvs|first1=Darryn|last1=Bryant|first2=Da ==Related problems== ...

In the mathematical theory of probability, the '''Heyde theorem'''&nbsp;is the [[characterizati * A. M. Kagan, Yu. V. Linnik, and C. R. Rao, ''Characterization Problems in Mathematical Statistics'', Wiley, New York (1973). ...