Search results
Jump to navigation
Jump to search
Page title matches
- {{about| what computer scientists call an alphabet|alphabets as a writing system|Alphabet}} In [[computer science]], an '''alphabet''' is a [[finite set|finite]] [[empty set|non-empty]] [[s ...3 KB (400 words) - 06:51, 6 July 2016
- #REDIRECT [[\Delta Seminar on Logic, Philosophy, and Computer Science]] ...71 bytes (9 words) - 05:51, 16 September 2015
- ...for the '''<math>\Delta</math> Workshop on Logic, Philosophy, and Computer Science'''. || '''Title''': Canonical Paths for Markov Chain Monte Carlo: from Art to Science ...5 KB (714 words) - 04:34, 17 January 2018
Page text matches
- #REDIRECT [[\Delta Seminar on Logic, Philosophy, and Computer Science]] ...71 bytes (9 words) - 05:51, 16 September 2015
- ...and Its Applications in Graph Theory.''' ''Theoretical Aspects of Computer Science'', 2002. [[media:Regularity.applications.pdf|<nowiki>[</nowiki>PDF<nowiki> * Trevisan. '''Additive Combinatorics and Theoretical Computer Science.''' 2009. [http://www.cs.berkeley.edu/~luca/pubs/addcomb-sigact.pdf <nowiki ...887 bytes (120 words) - 10:20, 4 January 2011
- {{about| what computer scientists call an alphabet|alphabets as a writing system|Alphabet}} In [[computer science]], an '''alphabet''' is a [[finite set|finite]] [[empty set|non-empty]] [[s ...3 KB (400 words) - 06:51, 6 July 2016
- '''Recursion''' is a word from [[mathematics]] and [[computer science]]. It is used to [[definition|define]] a thing, such as a [[Function (mathe Recursion can be used to write [[Computer programming|computer programs]]. A program that uses recursion may be easier to write and unders ...2 KB (301 words) - 20:47, 14 February 2017
- :S. Jukna. ''Extremal Combinatorics: With Applications in Computer Science, 2nd Edition.'' Springer, 2011. ...Knuth, and O. Patashnik. ''Concrete Mathematics: A Foundation for Computer Science, 2nd Edition.'' Addison-Wesley, 1994. ...1 KB (185 words) - 00:56, 2 September 2019
- :S. Jukna. ''Extremal Combinatorics: With Applications in Computer Science, 2nd Edition.'' Springer, 2011. ...Knuth, and O. Patashnik. ''Concrete Mathematics: A Foundation for Computer Science, 2nd Edition.'' Addison-Wesley, 1994. ...1 KB (185 words) - 04:33, 17 February 2014
- :S. Jukna. ''Extremal Combinatorics: With Applications in Computer Science, 2nd Edition.'' Springer, 2011. ...Knuth, and O. Patashnik. ''Concrete Mathematics: A Foundation for Computer Science, 2nd Edition.'' Addison-Wesley, 1994. ...1 KB (185 words) - 07:42, 1 August 2017
- :S. Jukna. ''Extremal Combinatorics: With Applications in Computer Science, 2nd Edition.'' Springer, 2011. ...Knuth, and O. Patashnik. ''Concrete Mathematics: A Foundation for Computer Science, 2nd Edition.'' Addison-Wesley, 1994. ...1 KB (185 words) - 15:04, 22 February 2013
- :S. Jukna. ''Extremal Combinatorics: With Applications in Computer Science, 2nd Edition.'' Springer, 2011. ...Knuth, and O. Patashnik. ''Concrete Mathematics: A Foundation for Computer Science, 2nd Edition.'' Addison-Wesley, 1994. ...1 KB (186 words) - 07:40, 18 February 2024
- :S. Jukna. ''Extremal Combinatorics: With Applications in Computer Science, 2nd Edition.'' Springer, 2011. ...Knuth, and O. Patashnik. ''Concrete Mathematics: A Foundation for Computer Science, 2nd Edition.'' Addison-Wesley, 1994. ...1 KB (186 words) - 10:26, 16 February 2023
- ...by the [http://tcs.nju.edu.cn theory group] in the Department of Computer Science and Technology at Nanjing University. ...losophy, and Computer Science|Δ Seminar on Logic, Philosophy, and Computer Science]] ...3 KB (218 words) - 08:11, 24 May 2024
- ...Knuth, and O. Patashnik. ''Concrete Mathematics: A Foundation for Computer Science, 2nd Edition.'' Addison-Wesley, 1994. ...100px]]||S. Jukna. ''Extremal Combinatorics: With Applications in Computer Science.'' Springer-Verlag, 2001. ...2 KB (203 words) - 10:00, 16 August 2011
- In [[computer science]] and [[mathematics]], an '''anonymous function''' is a function that has n * [[Closure (computer science)|Closure]] ...3 KB (355 words) - 05:21, 24 November 2013
- A '''computer algebra system (CAS)''' is a large [[computer program]] that helps people with [[mathematics]] and [[algebra]]. It chang ...m are often exact, simple, and generalized to work in all possible cases. Computer programs do have [[software bug|bugs]], so important results should always ...3 KB (424 words) - 02:38, 27 March 2013
- In [[computer science]], a '''space-time''' or '''time-memory tradeoff''' is a way of solving a p ...rogram speed when using [[loop unwinding]]. This [[technique]] makes the [[Computer program|program code]] longer for each iteration of a loop, but saves the c ...3 KB (482 words) - 01:39, 25 October 2013
- {{For|usage in computer science and programming|Parameter (computer science)}} In [[mathematics]], [[statistics]], and the mathematical [[science]]s, '''parameters''' ([[Latin|L:]] ''auxiliary measure'') are quantities th ...4 KB (677 words) - 11:57, 25 July 2016
- Our summer school is supported by the Department of Computer Science at Nanjing University, and will be held from July 13th to July 16th, 2024, ...ing both cutting-edge research and modern toolkits in theoretical computer science. ...6 KB (575 words) - 00:43, 12 July 2024
- ...al physics, machine learning, probability theory, and theoretical computer science. The partition function can be viewed as polynomial on the external fields :Zonglei Bai（白宗磊） is a Ph.D student in Department of Computer Science and Technology， Peking University, and he is supervised by Professor Hanpi ...20 KB (1,328 words) - 14:52, 20 November 2020
- [[Category:Theoretical computer science]] ...1 KB (208 words) - 12:39, 30 December 2016
- ...Knuth, and O. Patashnik. ''Concrete Mathematics: A Foundation for Computer Science, 2nd Edition.'' Addison-Wesley, 1994. ...3 KB (186 words) - 08:56, 16 August 2011