Search results

The '''union theorem''' is a result from the 60s in [[computational complexity theory]]. It was published<ref name="MM"> | conference = ACM Symposium on Theory of Computing ...

In mathematics, a '''bipartite matroid''' is a [[matroid]] all of whose circui ...rtite if and only if <math>r</math> is an odd number, because the circuits in such a matroid have size <math>r+1</math>. ...

...ongs to <math>C</math> (that is, if <math>f(x) = f(c)</math> then <math>x \in C</math>). Said more succinctly, the set <math>C</math> is called saturated ...set theory)|intersection]] of [[Open set|open subsets]] of <math>X.</math> In a [[T1 space|T₁ space]] every set is saturated. ...

*[[Karen Corr]] (born 1969), Irish pool player ==Places in Ireland== ...

In [[numerical analysis]], '''Gauss–Legendre quadrature''' is a form of [[Gaus ...e able to compute quadrature rules for significantly larger problem sizes. In 2014, Ignace Bogaert presented explicit asymptotic formulas for the Gauss–L ...

'''Semblance analysis''' is a process used in the [[Refinement (computing)|refinement]] and study of [[Reflection seismology|seismic data]]. The use Semblance analysis is a technique that first began to be developed and used in the late 1960s. Prior to the discovery of this method, identifying the main ...

In [[matroid theory]], an '''Eulerian matroid''' is a matroid whose elements c In a [[uniform matroid]] <math>U{}^r_n</math>, the circuits are the sets of ex ...

In mathematics, '''Owen's T function''' ''T''(''h'',&nbsp;''a''), named after ...on was first introduced by Owen in 1956.<ref>Owen, D B (1956). "Tables for computing bivariate normal probabilities". ''Annals of Mathematical Statistics'', ...

{{Short description|Computing using random bit streams}} ...then be computed by simple bit-wise operations on the streams. Stochastic computing is distinct from the study of [[randomized algorithm]]s. ...

...r version appeared in ''Proceedings of the 32nd ACM Symposium on Theory of Computing,'' May 2000, 397–406.</ref><ref name="opportunistic_2000">Paolo Ferragina a ...bet Σ, a compressed suffix array supports searching for arbitrary patterns in ''T''. For an input pattern ''P'' of ''m'' characters, the search time is ...

{{Short description|Solution in cooperative games}} ...Journal on Applied Mathematics |volume=17 |issue=6 |pages=1163–1170 |year=1969 |postscript=. |doi=10.1137/0117107}} ...

{{Short description|Connectivity measure in graph theory}} {{for|related notion (also called cycle rank) in undirected graphs|circuit rank}} ...

..._{M}^{I}:\mathbb{N}\rightarrow\mathbb{N}</math> such that, for all <math>n\in\mathbb{N}</math>, .... G. ''Introduction to Commutative Algebra''. Reading, MA: Addison–Wesley, 1969.</ref> ...

...roid <math>M^\ast</math> that has the same elements as <math>M</math>, and in which a set is independent if and only if <math>M</math> has a basis set di | series = Oxford Graduate Texts in Mathematics ...

...[[Morton L. Curtis]], [[Gustav A. Hedlund]], and [[Roger Lyndon]]; in his 1969 paper stating the theorem, Hedlund credited Curtis and Lyndon as co-discove ...id = 21803927 }}.</ref> It has been called "one of the fundamental results in symbolic dynamics".<ref>{{citation ...

...n University]] in 1962,{{r|green}} and completed a Ph.D. in mathematics in 1969 at [[Arizona State University]]. Her dissertation, ''Some Results on <math> ...ormation science.{{r|green}} She came to the University of Hawaiʻi at Hilo in 1990,{{r|regents}} and chaired the computer science department there for ma ...

{{Short description|Mathematical problem solved in 1967}} ...math>x</math> in the unit interval, then there must be some <math>x</math> in the unit interval for which <math>f(x) = x = g(x)</math>. ...

{{Short description|Computation which does not terminate or terminates in an exceptional state}} ...s2cid=207726175 }}</ref>{{rp|377}} Otherwise it is said to '''converge'''. In domains where computations are expected to be infinite, such as [[process c ...

{{Short description|Min-max theorem in graph theory}} In the mathematical discipline of [[graph theory]], the '''Erdős–Pósa theorem' ...

...ers to the fact that controlled operations have effects on their controls, in addition to on their targets, and that these effects correspond to phasing In classical computing, operations are deterministic and reversible. ...