Search results
Jump to navigation
Jump to search
- ...[http://en.wikipedia.org/wiki/Sorting_network sorting networks] and robust computer networks. They have also been used in proofs of many important results in c ...8 KB (1,407 words) - 02:23, 25 July 2011
- [[Category:Computer science]] ...5 KB (680 words) - 01:48, 26 April 2013
- ...in the first year of studies. Matrices are also very common in [[computer science]]. ...e are no simple formulas for the determinants of larger matrices, and many computer programmers study how to get computers to quickly find large determinants. ...8 KB (1,194 words) - 21:26, 28 May 2017
- ...lisher=Ballantine Books|year=2006|isbn=978-0-7394-7582-9|pages=544|chapter=Science}}</ref> the flowering of [[artichoke]], the uncurling of a fern and the arr ...s having to use recursion to calculate Fibonacci numbers, which can take a computer a long time to do. ...4 KB (560 words) - 16:16, 13 July 2017
- [[Category:Computer science]] ...5 KB (707 words) - 11:24, 18 May 2013
- ...name="ctcs">[http://www.tug.org/texshowcase/cheat.pdf Theoretical computer science cheat sheet]</ref> <math>\sum_{i=0}^\infty {i+n \choose i} x^i = \frac{1}{( ...7 KB (1,090 words) - 18:10, 19 October 2014
- [[Category:Computer science]] ...5 KB (705 words) - 06:46, 13 June 2017
- ...13 = Jukna. ''Extremal Combinatorics: <br> With Applications in Computer Science,<br>2nd ed.'', Springer, 2011. ...9 KB (998 words) - 05:12, 11 June 2014
- ...ay have alternate meanings and may also differ from those used in computer science. ...8 KB (1,182 words) - 07:31, 3 November 2013
- ...13 = Jukna. ''Extremal Combinatorics: <br> With Applications in Computer Science,<br>2nd ed.'', Springer, 2011. ...11 KB (1,243 words) - 12:46, 15 September 2017
- ...13 = Jukna. ''Extremal Combinatorics: <br> With Applications in Computer Science,<br>2nd ed.'', Springer, 2011. ...11 KB (1,070 words) - 12:46, 15 September 2017
- ...n as '''CGT''' is a branch of applied mathematics and theoretical computer science that studies combinatorial games, and is distinct from "traditional" or "ec ...6 KB (1,097 words) - 23:35, 19 September 2015
- ...13 = Jukna. ''Extremal Combinatorics: <br> With Applications in Computer Science,<br>2nd ed.'', Springer, 2011. ...11 KB (1,223 words) - 07:38, 2 January 2018
- ...is meaningful only if it produces correct outcomes. On a scalable quantum computer with millions of qubits, by protecting the quantum information using error ...ter and System Sciences, Information and Computation, Theoretical Computer Science, IEEE transaction on Fuzzy Systems, Physical Review A 等国际著名学术期刊发表论文近50篇，SCI ...24 KB (1,651 words) - 02:56, 12 March 2024
- ...13 = Jukna. ''Extremal Combinatorics: <br> With Applications in Computer Science,<br>2nd ed.'', Springer, 2011. ...12 KB (1,290 words) - 06:43, 27 December 2019
- A '''Taylor series''' is an idea used in [[computer science]], [[calculus]], and other kinds of higher-level [[mathematics]]. It is a [ ...7 KB (1,081 words) - 10:05, 24 June 2017
- ...ity.html |title=Finite and Infinite Sets |author= |date= |website=Computer Science |publisher=University of Texas at Austin |accessdate=28 August 2016}}</ref> ...12 KB (1,234 words) - 02:16, 5 September 2016
- ...13 = Jukna. ''Extremal Combinatorics: <br> With Applications in Computer Science,<br>2nd ed.'', Springer, 2011. ...14 KB (1,438 words) - 18:58, 9 April 2024
- ...13 = Jukna. ''Extremal Combinatorics: <br> With Applications in Computer Science,<br>2nd ed.'', Springer, 2011. ...14 KB (1,492 words) - 06:39, 19 June 2024
- ...[http://en.wikipedia.org/wiki/Sorting_network sorting networks] and robust computer networks. They have also been used in proofs of many important results in c ...15 KB (2,745 words) - 10:19, 4 January 2011