Search results

...ww.cse.iitk.ac.in/users/manindra/algebra/primality_v6.pdf |title=PRIMES is in P |journal=[[Annals of Mathematics]] |volume=160 |year=2004 |issue=2 |pages ...ive-url=https://web.archive.org/web/20180425032115/https://www.cse.iitk.ac.in/users/nitin/talks/Dec2014-3Paris.pdf|archive-date=25 April 2018|url-status= ...

...caltech.edu/ph219/topological.pdf John Preskill's lecture notes on quantum computing, section 9.14]</ref><ref name=":72">{{Cite book |last=Simon |first=Steven H ...system]]. In particular, it is possible that Fibonacci anyons are present in the system with filling factor <math>\nu=12/5</math>.<ref>{{Cite journal |l ...

...https://ieeexplore.ieee.org/document/1028914|pages=303–312|doi=10.1109/DSN.2002.1028914|isbn=0-7695-1597-5 |s2cid=11094028 }}</ref> It is a hybrid algorith ...de (<math>N_1</math>) sends a ping to random other node (<math>N_2</math>) in its membership list. ...

'''Uncomputation''' is a technique, used in [[Reversible computing|reversible]] circuits, for cleaning up temporary effects on [[Ancilla Bit|a ...l=Quantum Information and Computation |volume=3|issue=2|pages=165–174|year=2002|doi=10.26421/QIC3.2-7 |bibcode=2002quant.ph..9060A}}</ref> ...

{{Short description|Problem in computer science}} ...run much more quickly than known non-quantum methods for the same problem. In its general form, it is equivalent to the [[hidden subgroup problem]] for t ...

....<ref>{{Cite web|title=Satish Rao {{!}} Simons Institute for the Theory of Computing|url=https://simons.berkeley.edu/people/satish-rao|access-date=2021-06-02|we ...|access-date=2021-06-02|website=awards.acm.org|publisher=[[Association for Computing Machinery]]|language=en}}</ref> ...

...ation theoretic barrier with fusion trees|journal=[[Symposium on Theory of Computing]]|pages=1–7|date=1990}}</ref> ...rations and [[bitwise operations]] including [[logical shift]]s to be done in [[constant time]] (the precise instruction set assumed by an algorithm or p ...

...r his work on matching geometric shapes, including methods for efficiently computing the [[Fréchet distance]] between shapes. He was also the first to use the G ...[[Kurt Mehlhorn]] at [[Saarland University]], where he completed his Ph.D. in 1976 on algorithms for parsing [[context-free language]]s.{{r|mg}} ...

...ame being a reference to "{{lang|de|Rechenplan}}" (i.e. computation plan), in [[Konrad Zuse]]'s terminology designating a single {{lang|de|[[Plankalkül]] ...n}} (i.e. ''Automatically created Computation Plans for Program-Controlled Computing Machines'').<ref name="Rutishauser_1951"/> ...

In [[Galois cohomology]], '''local Tate duality''' (or simply '''local duality ...[local Euler characteristic formula]] provide a versatile set of tools for computing the Galois cohomology of local fields. ...

...0 6.png|thumb|Flattening a (3rd-order) tensor. The tensor can be flattened in three ways to obtain matrices comprising its mode-0, mode-1, and mode-2 vec In [[multilinear algebra]], '''mode-m flattening'''{{r|Vasilescu2009|vasilescu ...

...g data replicas and are a basic mechanism for [[optimistic replication]]. In mathematical terms, the version vector generates a [[preorder]] that tracks ...ical to that in a [[vector clock]], but the update rules differ slightly; in this example, replicas can either experience local updates (e.g., the user ...

...= [[University of Chicago]]<br>[[Harvard Medical School]]<br>[[Scientific Computing and Imaging Institute]]<br>[[University of Chicago]] ...st|access-date=5 April 2017}}</ref> He is recognized for his contributions in developing tools for [[tensor]] data visualization. ...

....E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In ''Proceedings of the 40th IEEE Symposium on Foundations of Computer Science In the [[external memory model]], the number of memory transfers it needs to p ...

...t of ''n'' points in the [[plane (mathematics)|plane]] (or more generally, in <math>\mathbb{R}^{d}</math>) is a [[minimum spanning tree]] of that set, wh ...an be found using existing algorithms for finding a minimum spanning tree. In particular, using [[Prim's algorithm]] with an [[adjacency matrix]] yields ...

{{Short description |Computing technique in probability theory}} ...[https://archive.org/details/performanceevalu0000unse/page/36 36] | year = 2002 | isbn = 978-3-540-44252-3 | chapter-url = http://www.cs.wm.edu/~riska/pape ...

In [[computer science]], the '''order-maintenance problem''' involves maintain * <code>insert(X, Y)</code>, which inserts X immediately after Y in the total order; ...

...tson University]] in 1962,{{r|green}} and completed a Ph.D. in mathematics in 1969 at [[Arizona State University]]. Her dissertation, ''Some Results on < ...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|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|Graph modeling collaboration in a social network}} ...749-6632.1979.tb17777.x|s2cid=84887029 }}</ref><ref>Frank Harary. ''Topics in Graph Theory''. [[New York Academy of Sciences]], 1979. {{ISBN|0-89766-028 ...