Search results

...f ''edges removed''/''components created'' in a decomposition of the graph in question. It is a method to compute [[Partition of a set|partitions]] of th ...ition <math>\pi\in\Pi</math>, then <math>\displaystyle\sigma(G)=\min_{\pi\in\Pi}\frac{|\partial \pi|}{|\pi|-1}</math>. ...

...er of subsets of four leaves that are not related by the same [[topology]] in both trees. ==Computing the quartet distance== ...

...arge ''{{Mvar|x}}'', Meissel tried to simplify the counting of the numbers in the Sieve of Eratosthenes. He and Lehmer therefore introduced certain sieve which proves that one may compute {{Math|''&pi;''(''x'')}} by computing {{Math|''&phi;''(''x'',''a'')}} and {{Math|''P''_''k''(''x'', ''a ...

...enclosing boxes.|volume=14|year=1985|issue=3|s2cid=8311538}}. As reviewed in {{zbl|0582.68067}}</ref> ...>{{citation|url=http://www.dlib.org/dlib/november98/11halpern.html|title=A Computing Research Repository|magazine=D-Lib Magazine|first=Joseph Y.|last=Halpern|da ...

*[[Barry Corr]] (born 1985), Irish footballer ==Places in Ireland== ...

...nt of data | date = 1985}}</ref><ref name = Chang>{{Citation | first1 = Ye-In | last1 = Chang | first2 = Chien-I | last2=Lee | first3= Wann-Bay | last3=C ...math>, the key <math>k</math> is mapped into a real number <math>x=S+h(k) \in[S, S+1]</math>. The final address is then computed as <math>\lfloor d^x \rf ...

'''Ulrich Pinkall''' (born 1955) is a German mathematician, specializing in differential geometry and computer graphics.<ref name=homepage>{{cite web|t ...Institute for Mathematics]] in Bonn. In 1985 he completed his habilitation in Bonn with thesis ''Totale Absolutkrümmung immersierter Flächen'' (Total abs ...

{{short description|Generalization of the vector space model used in information retrieval}} ...=Wong | publisher=[[Association for Computing Machinery|SIGIR ACM]] | date=1985-06-05| doi=10.1145/253495.253506 | isbn=0897911598 | doi-access=free }}</re ...

...the items into bins of fixed capacity, such that the sum of sizes of items in each bin is at most the capacity. Ideally, we would like to use as few bins ** If such a bin is found, put the new item in it. ...

...''Tardos function''' is a [[graph invariant]] introduced by [[Éva Tardos]] in 1988 that has the following properties:<ref name=e>{{citation *The Tardos function is monotone, in the sense that adding edges to a graph can only cause its Tardos function t ...

...rcher at the [[Alfréd Rényi Institute of Mathematics]], Budapest. He works in [[combinatorics]] and [[group theory]]. Pyber received his Ph.D. from the [[Hungarian Academy of Sciences]] in 1989 under the direction of [[László Lovász]] and [[Gyula O. H. Katona|Gyul ...

...ion]]. [[Algorithms]] are known for decomposing [[univariate polynomial]]s in [[polynomial time]]. Polynomials which are decomposable in this way are '''composite polynomials'''; those which are not are '''indeco ...

..., also called a '''zigzag poset''', is a [[partially ordered set]] (poset) in which the order [[Relation (mathematics)|relations]] form a path with alter ...inite]], or it may be formed by an infinite alternating sequence extending in both directions. The [[incidence poset]]s of [[path graph]]s form examples ...

{{short description|Heart rate measuring algorithm used in ECGs}} ...measuring [[heart rate]], the first way to assess the heart health state. In the first derivation of [[Einthoven]] of a physiological heart, the QRS com ...

...ved that NP is unequal to [[co-NP]] (the class of complements of languages in NP), which would imply more strongly that the complements of all [[NP-compl ...ativity and the {{nowrap|<math>k</math>-creative}} sets were introduced in 1985 by [[Deborah Joseph]] and Paul Young, following earlier attempts to define ...

...er of eligible partitions for each tree is equal to the number of branches in that tree. ...ha^{-1}</math> expands an edge (decontraction), where the set can be split in any fashion. ...

{{Short description|Conjecture in probabilistic combinatorics}} ...proposed [[counterexample]] to the conjecture was posted on the [[arXiv]] in October 2024 by Nikita Gladkov, [[Igor Pak]], and Alexander Zimin.<ref>{{ci ...

|title = Robust Distributed Computing and Sensing Algorithm ...''interval measurements''' taken by a [[distributed sensor network]], even in the presence of faulty sensors.<ref> ...

...equencing of stages, which severely restricted its programmability but was in a sense the purest “systolic-array” design. ...0.1145/285930.285950 Retrospective: a retrospective on the Warp machines.] In 25 years of the international symposia on Computer architecture (selected p ...

...m]] and are, in particular, useful for constructing polynomial-size proofs in these systems. The characterization of standard complexity classes and corr ...Feasibility in Arithmetic, Jour. Symbolic Logic 36 (1971) 494–508.</ref> in 1971, and later developed by [[Samuel Buss|Samuel R. Buss]]. <ref name="bus ...