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 '''sparse polynomial''' (also '''lacunary polynomial'''{{r|r ...l}} Sparse polynomials have also been used in pure mathematics, especially in the study of [[Galois group]]s, because it has been easier to determine the ...

...Leighton in 1979.<ref name=":0">{{Cite journal|last=Leighton|first=F.|date=1979|title=A graph coloring algorithm for large scheduling problems|journal=Jour ...ime. It does this by identifying a [[maximal independent set]] of vertices in the graph, assigning these to the same color, and then removing these verti ...

...year = 1979 | issue = 11 }}</ref><ref>{{cite book|title=Numerical Methods in Engineering with Python|first=Jaan |last=Kiusalaas| publisher=Cambridge Uni ...first4=BP | year=2007 | title=[[Numerical Recipes]]: The Art of Scientific Computing | edition=3rd | publisher=Cambridge University Press | publication-place=N ...

...y communication complexity''' is the study of [[communication complexity]] in the setting where there are more than 2 players. ...communication complexity|communication game]], introduced by {{harvtxt|Yao|1979}},<ref>{{citation ...

...007379|series=STOC '04|location=Chicago, IL, USA|publisher=Association for Computing Machinery|pages=128–137|doi=10.1145/1007352.1007379|isbn=978-1-58113-852-8| ...ation and Cryptography (TQC 2020)|series=Leibniz International Proceedings in Informatics (LIPIcs) |volume=158 |pages=1:1–1:16 |doi=10.4230/LIPIcs.TQC.20 ...

In [[graph theory]] and [[theoretical computer science]], the '''colour refine ...s a function from the vertices of this graph into some set (of "colours"). In each iteration, we define a sequence of vertex colourings <math> \lambda_i ...

{{Short description|Graph modeling collaboration in a social network}} ...ank Harary. ''Topics in Graph Theory''. [[New York Academy of Sciences]], 1979. {{ISBN|0-89766-028-5}}</ref> is a graph modeling some [[social network]] w ...

...graphs.<ref name=":1" /> DSatur has also been referred to as saturation LF in the literature.<ref>{{Cite book|title=Graph Colorings (Vol.352)|last=|first ...n. In cases of ties, choose the vertex among these with the largest degree in the subgraph induced by the uncolored vertices. ...

...base systems]]. It plays important roles in [[database theory]] as well as in practice. ...esign.{{citation needed|date=November 2012}} New applications of the chase in meta-data management and data exchange are still being discovered. ...

...language=en}}</ref> Frege systems (more often known as [[Hilbert system]]s in general [[proof theory]]) are named after [[Gottlob Frege]]. ...rnal |last1=Cook |first1=Stephen A. |last2=Reckhow |first2=Robert A. |date=1979 |title=The relative efficiency of propositional proof systems |url=https:// ...

...z]] in his 1979 paper ''On the Shannon Capacity of a Graph''.{{sfnp|Lovász|1979}} Accurate numerical approximations to this number can be computed in [[polynomial time]] by [[semidefinite programming]] and the [[ellipsoid met ...

...rstand the complexity of computing polynomials. The basic type of question in this line of research is "what is the most efficient way to compute a given ...d in the second a ''product'' gate. An ''arithmetic formula'' is a circuit in which every gate has [[outdegree]] one (and so the underlying graph is a [[ ...

...sign, [[data-mining]], [[finite elements]] and communication in [[parallel computing]]. ...o the edges {{math|''w'': ''E'' &rarr; ''N''}} and an [[integer]] <math>k \in \{2,3, \ldots, |V|\},</math> [[Partition (mathematics)|partition]] {{mvar|V ...

...es are colored such that every edge has at least one vertex of each color (in this case, red and green).]] ...split by this partition, i.e., none of the elements of ''F'' is completely in ''S₁'' or ''S₂''. Set Splitting is one of [[Computers ...

...n Boolean formula can be consistently replaced by the values TRUE or FALSE in such a way that the formula [[Validity (logic)|evaluates to TRUE]]. For exa ...otal number of solutions to a Boolean formula is known, SAT can be decided in constant time. However, the converse is not true, because knowing a Boolean ...

| released = {{Start date|1979}} ...tem of linear equations]] ''Ax''&nbsp;=&nbsp;''b'', which is a common task in [[engineering]]. ...

...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 ...

...don|pages=189–214}}</ref> Methods of computing this index differ primarily in the way the upslope contributing area is calculated. ...title=Response to: Getting Negative Topographic Wetness Index (TWI) values in SAGA GIS?| accessdate=2023-07-25 |publisher=Stack Exchange Network}}</ref> ...

...s]] of the graph that has a nonempty intersection with every [[odd cycle]] in the graph. Removing the vertices of an odd cycle transversal from a graph l ...versal can be bipartitioned according to which copy of the vertex was used in the cover.{{r|pa}} ...