Search results

...ty of Graphs|title=Automated Deduction in Geometry|series=Lecture Notes in Computer Science|volume=9201|pages=129–148|doi=10.1007/978-3-319-21362-0_9|isbn=978- ...ension of a Graph|title=Combinatorial Optimization|series=Lecture Notes in Computer Science|volume=7422|pages=356–367|doi=10.1007/978-3-642-32147-4_32|doi-acce ...

...imation Algorithms |url=https://doi.org/10.1093/comjnl/bxm048 |journal=The Computer Journal |volume=51 |issue=1 |pages=60–78|doi=10.1093/comjnl/bxm048 }}</ref> ...ity of k-Cut and Related Problems |journal=Electronic Notes in Theoretical Computer Science |series=CATS'03, Computing: the Australasian Theory Symposium |lang ...

In [[mathematical logic]] and [[computer science]], '''homotopy type theory''' ('''HoTT''') refers to various lines ...make possible); and the [[Formal proof|formalization]] of each of these in computer [[proof assistant]]s. ...

Costs for each event and a dynamic programming technique considering all pairs of host and symbiont nodes were then introd ...8 }}</ref> a new reconciliation model, following and improving the dynamic programming approach presented for host and symbiont, effectively introduced horizontal ...

*'''[[Leonid Kantorovich]]''', mathematician and economist, founded [[linear programming]], developed the theory of [[Optimization (mathematics)|optimal allocation] ...]]''', [[Formalism (literature)|formalist]] scholar, major researcher of [[Folklore|folk tale]]s and [[mythology]] ...