Search results

...Theory. 2018.</ref> when studying [[Upper and lower bounds|lower bounds]] in computer science named after [[Rasmus Pagh]]. ...amic problems." Proceedings of the forty-second ACM symposium on Theory of computing. 2010.</ref> ...

| known_for = {{ublist|[[Quantum computing]]|[[Loss–DiVincenzo quantum computer]]| [[DiVincenzo's criteria]]}} ...tle=Alexander von Humboldt Professorship – Award Winners 2011 |access-date=2015-12-14 |archive-date=2018-10-20 |archive-url=https://web.archive.org/web/201 ...

...convex polytopes <math>Q</math> that have <math>P</math> as a projection. In this context, <math>Q</math> is called an '''extended formulation''' of <ma ...researchers have studied the extension complexity of the polytopes arising in this way.{{r|at}} For instance, it is known that the [[matching polytope]] ...

...sh|date=January 2019}}{{Short description|Description of limiting behavior in probabilistic algorithms}} In [[mathematics]], an event that occurs '''with high probability''' (often sh ...

{{Refimprove|date=December 2015}} In [[mathematics]], a '''Catalan pseudoprime''' is an odd [[composite number]] ...

...e Schneier, ''Applied Cryptography: Protocols, Algorithms, and Source Code in C'', pages 416-417, Wiley; 2nd edition (October 18, 1996), {{ISBN|047111709 ...anuel |last2=Micali |first2=Silvio |s2cid=7008910 |journal=SIAM Journal on Computing |volume=13 |issue=4 |pages=850–864 }}</ref> ...

...|last2=Grier|first2=Daniel|last3=Schaeffer|first3=Luke|class=quant-ph|year=2015}}</ref> Uncomputation is a fundamental step in [[quantum computing]] algorithms. Whether or not intermediate effects have been uncomputed affe ...

{{short description|Generalization of the vector space model used in information retrieval}} ...last2=Ziarko|first3=Patrick C. N.|last3=Wong | publisher=[[Association for Computing Machinery|SIGIR ACM]] | date=1985-06-05| doi=10.1145/253495.253506 | isbn=0 ...

...ied Regression Analysis and Generalized Linear Models | edition=3rd | year=2015 | location=Thousand Oaks | chapter=19 }}</ref> In a standard least squares problem, the estimated parameter values β are defi ...

In [[economics]], especially in [[consumer theory]], a '''Leontief utility function''' is a function of the * <math>m</math> is the number of different [[good (economics)|goods]] in the economy. ...

...|condition]] a [[probability space]] upon the occurrence of a given event. In symbols, once we postselect for an event <math>E</math>, the probability of ...at <math display="inline">\operatorname{Pr}[E]</math> be strictly positive in order for the postselection to be well-defined. ...

...apman & Hall|isbn=978-1482211184|last1=Solihin|first1=Yan|date=17 November 2015}}</ref> ...3=T. R.|last4=Emma|first4=P. G.|title=Proceedings of the 3rd conference on Computing frontiers |chapter=Cache miss behavior |date=2006-01-01|chapter-url=http:// ...

...ame being a reference to "{{lang|de|Rechenplan}}" (i.e. computation plan), in [[Konrad Zuse]]'s terminology designating a single {{lang|de|[[Plankalkül]] ...n}} (i.e. ''Automatically created Computation Plans for Program-Controlled Computing Machines'').<ref name="Rutishauser_1951"/> ...

...r his work on matching geometric shapes, including methods for efficiently computing the [[Fréchet distance]] between shapes. He was also the first to use the G ...[[Kurt Mehlhorn]] at [[Saarland University]], where he completed his Ph.D. in 1976 on algorithms for parsing [[context-free language]]s.{{r|mg}} ...

...t is used to check how much two [[quantum states]] differ, appearing first in the work of Barenco et al.<ref name="BBDEJM97"> | journal = SIAM Journal on Computing ...

{{Short description|Security vulnerability in Diffie–Hellman key exchange}} ...ws|work=The Wall Street Journal|first=Jennifer|last=Valentino-DeVries|date=2015-05-19|url-access=subscription|access-date=2022-04-30|archive-date=2022-02-2 ...

In [[probability theory]], a '''random recursive tree''' is a [[rooted tree]] ...se that there is no distinguished ordering of the children of each vertex. In a random recursive tree, all such trees are equally likely. ...

...umbering|index]] of the [[Bit numbering|most significant]] activated line. In contrast to the simple encoder, if two or more inputs to the priority encod Applications of priority encoders include their use in [[Programmable interrupt controller|interrupt controllers]] (to allow some ...

{{no footnotes|date=February 2015}} {{one source|date=February 2015}} ...

...tp://www.math.miami.edu/~wachs/ Michelle Wachs], Univ. of Miami, retrieved 2015-01-02.</ref> ...achs algorithm]] for [[optimal binary search tree]]s, which they published in 1977.{{r|knuth}}{{ran|A}} ...