Search results

In [[Boolean algebra (logic)|Boolean algebra]], a '''parity function''' is a The parity function is notable for its role in theoretical investigation of [[circuit complexity]] of Boolean functions. ...

...st-squares_estimators|see the picture below]] and note that as explained in the ...the normal-equations matrix (the [[Gramian matrix]]). An exception occurs in [[numerical smoothing and differentiation]] where an analytical expression ...

...onding member of the Romanian Academy in 1955, and he became a full member in 1963.<ref name="ictp"/> ...The topological interpretation of [[Helicity (particle physics)|helicity]] in terms of the Gauss linking number and its limiting form has been called the ...

{{short description|Algorithm for counting perfect matchings in planar graphs}} ...nts the number of [[perfect matching]]s in a [[planar graph|planar]] graph in polynomial time. This same task is [[Sharp-P-complete|#P-complete]] for gen ...

...dge base]]. Specifically, in ESA, a word is represented as a column vector in the [[tf*idf|tf–idf]] matrix of the text corpus and a document (string of w ...|first1=Evgeniy |last1=Gabrilovich |first2=Shaul |last2=Markovitch |title=Computing semantic relatedness using Wikipedia-based Explicit Semantic Analysis |conf ...

...|title=On Context-Free Languages|journal=Journal of the [[Association for Computing Machinery]]|volume=13|issue=4|pages=570–581|doi=10.1145/321356.321364|s2cid ...i}</math> denotes the number of occurrences of the symbol <math>a_i</math> in the word <math>w</math>. ...

...mong people with different valuations over parts of the resource. The goal in egalitarian cake-cutting is to maximize the smallest value of an agent; sub ...er Dubins|last2=Spanier|first2=Edwin Henry|author2-link=Edwin Spanier|year=1961|title=How to Cut a Cake Fairly|journal=The American Mathematical Monthly|vo ...

Saprobic water quality is expressed in four classes ranging from I to IV; and with three intermediate grades (I-II == Computing the saprobic index == ...

...tion of ''B'' can be algorithmically converted to an enumeration of ''A''. In particular, if ''B'' is [[computably enumerable]], then ''A'' also is. In one of the possible formalizations of the concept, a [[Turing reduction]] f ...

...aurie Snell''' (January 15, 1925 in Wheaton, [[Illinois]] – March 19, 2011 in Hanover, [[New Hampshire]]) was an American mathematician and educator. ...) to play piano, cello, and violin. The family had a life-lease on a cabin in [[Isle Royale National Park]] where they would go for summer holidays.<ref> ...

{{short description|Large multi-threaded computer released in 1960}} {{Infobox computing device ...

...nk.springer.com/chapter/10.1007%2F978-3-662-53413-7_2|series=Lecture Notes in Computer Science|volume=9837 |language=en|location=Berlin, Heidelberg|publi ...https://link.springer.com/book/10.1007/978-3-642-01492-5|series=Monographs in Theoretical Computer Science. An EATCS Series |language=en-gb|doi=10.1007/9 ...

{{Short description|A theory in statistics}} <!-- This article was started in British English and so makes extensive use of chi-squared rather than chi-s ...

{{short description|Problem in linear algebra}} In [[linear algebra]], the computation of the [[Permanent (mathematics)|perman ...

{{Short description|Concept in algebraic geometry}} In [[mathematics]], especially in [[algebraic geometry]] and the theory of [[complex manifold]]s, '''coherent ...

...of elements, is cumbersome. Light's associativity test simplifies the task in some instances (although it does not improve the worst-case runtime of the ...oosing some element ''a'' in ''A'', two new binary operations are defined in ''A'' as follows: ...

...{{ISBN missing}}</ref> Other shared concepts and analysis techniques exist in these two types of percolation theory as well as the study of [[random grap ...1987recent">{{cite journal|first=I.|last=Balberg|title=Recent developments in continuum percolation|journal=Philosophical Magazine B|volume=56|issue=6|pa ...

...rks]], containing a chapter dedicated to counter the criticisms made of it in the 1980s. ...the AI research community, and are known to have promoted loud discussions in conferences, yet remained friendly.{{sfn|Olazaran|1996}} ...

{{About|a compression scheme|the similarly named transponder code in aeronautics|Squawk code}} ..."Jones_2018"/> A program in this format was called a ''SQUOZE [[card deck (computing)|deck]]''.<ref name="Boehm-Steel_1958"/><ref name="Boehm-Steel_1959"/><ref ...

...on''' or '''clearing-prices computation''') is a [[computational problem]] in the intersection of [[economics]] and [[computer science]]. The input to th ...in which all buyers have equal incomes, is particularly interesting, since in this setting a competitive equilibrium is also [[Envy-freeness|envy-free]]. ...