Search results
Jump to navigation
Jump to search
- ...8.</ref> when studying [[Upper and lower bounds|lower bounds]] in computer science named after [[Rasmus Pagh]]. ...ceedings of the forty-seventh annual ACM symposium on Theory of computing. 2015.</ref> ...2 KB (247 words) - 22:48, 6 August 2021
- In [[surface chemistry]], the '''Hertz–Knudsen equation''', also known as '''K ...tion.pdf EE-527: Micro Fabrication], Virginia University (retrieved Feb. 9 2015).</ref> ...3 KB (378 words) - 16:40, 19 January 2025
- ...' is an Indian mathematician at the [[University of Toronto]] specializing in [[number theory]], particularly arithmetic statistics. ...nnals of Mathematics 181 (2015), 587–621 https://dx.doi.org/10.4007/annals.2015.181.2.4</ref> respectively, thus proving the [[Birch and Swinnerton-Dyer co ...2 KB (303 words) - 00:31, 15 May 2024
- {{Short description|Quantum Information Science}} ...Physics |language=en |volume=2015 |issue=6 |pages=149 |doi=10.1007/JHEP06(2015)149 |arxiv=1503.06237 |bibcode=2015JHEP...06..149P |s2cid=256004738 |issn=1 ...4 KB (596 words) - 01:37, 26 October 2024
- ...tp://www.math.psu.edu/wdb/CV.html Curriculum vitae], retrieved January 25, 2015.</ref> and is particularly known for his proof of explicit degree bounds th | title = Surveys in modern mathematics ...4 KB (528 words) - 07:52, 6 May 2024
- ...in database theory since the 1970s,<ref name="Libkin"/> is indeed defined in the context of [[open world assumption]], where the given knowledge base is ...ain answers is usually defined as follows:<ref name="Libkin">{{harv|Libkin|2015}}.</ref> ...4 KB (597 words) - 15:42, 8 December 2024
- .../ref> first results on October 30, 2013. He is also a leading investigator in the new LUX-Zeplin (LZ) dark matter experiment.<ref>DOE, NSF to fund LUX-ZE ...ulwich College]] and received his BA and MA degrees from Oxford University in 1985. He was a scholar at St John's College and is the grandson of [[Labour ...7 KB (943 words) - 22:08, 6 February 2023
- ...ternational Conference on Computer Logic |series=Lecture Notes in Computer Science |volume=417 |publisher=Springer |location=Berlin, Heidelberg |isbn=978-3-54 ...set of formulae can be transformed into an equisatisfiable set of formulae in this normal form.<ref>{{cite journal |last1=Goré |first1=Rajeev |last2=Nguy ...3 KB (491 words) - 18:34, 15 April 2024
- ...derstanding how a network changes in response to node deletion is critical in many empirical networks. Application varies across many fields, including ...fferently.<ref>Barabási, A.-L. NETWORK SCIENCE, Cambridge University Press 2015</ref> ...5 KB (788 words) - 13:14, 6 November 2023
- ...1957) is a Dutch physicist who works on [[nanotechnology]]-miniaturization in physics, chemistry, biology and biotechnology ([[nanofluidics]], [[nanosens ...1998 he had a part-time professorship and from 2000 a full professorship. In 2003 he became head of nanofluidics within the Dutch national nanotechnolog ...6 KB (835 words) - 22:18, 16 June 2023
- ...te= |website= Department of Mathematics |publisher= [[Pohang University of Science and Technology]] |access-date= 14 February 2025 |quote= |language= Korean}} | workplaces = [[Pohang University of Science and Technology]], [[National Institute for Mathematical Sciences]] ...12 KB (1,272 words) - 20:07, 23 February 2025
- ...eory]], and [[computer science education]]. She is a professor of computer science at the [[University of Kentucky]]. ...graduated from [[Princeton University]] in 1982, with a bachelor's degree in mathematics.{{r|cv}} ...5 KB (629 words) - 13:58, 5 January 2024
- ...rsity Press|url=http://barabasi.com/networksciencebook/|access-date=25 May 2015}}</ref> ...networks are indeed sparse. There is, however, a formal sense of sparsity in the case of infinite network models, determined by the behavior of the numb ...7 KB (1,091 words) - 18:04, 4 January 2024
- ...17''(8), 401–412. http://doi.org/10.1016/j.tics.2013.06.007</ref>{{rp|4}} In a conceptual space, ''points'' denote objects, and ''regions'' denote conce ...]] library: studies in epistemology, logic, methodology, and philosophy of science |volume=359 |location=Cham |publisher=[[Springer-Verlag]] |isbn=978-3319150 ...4 KB (532 words) - 22:44, 28 April 2024
- In [[type theory]], a '''polynomial functor''' (or '''container functor''') is ...t1=Moerdijk|first1=Ieke|last2=Palmgren|first2=Erik|title=Wellfounded trees in categories|journal=Annals of Pure and Applied Logic|volume=104|issue=1–3|pa ...4 KB (602 words) - 15:52, 4 October 2024
- {{Use British English|date=October 2015}} ...d by the other channel.<ref>{{cite book|title=Academic Press Dictionary of Science and Technology|url=https://archive.org/details/academicpressdic00morr|url-a ...3 KB (428 words) - 15:18, 23 December 2024
- | work_institutions = [[Pohang University of Science and Technology]] ...ofile">[http://yjchoie.postech.ac.kr/ Faculty profile], POSTECH, retrieved 2015-02-19.</ref> ...8 KB (1,016 words) - 12:32, 7 February 2025
- ...irst of eight “[https://www.nafems.org/congress/thebigissues/ big issues]” in [[numerical simulation]]. ...ication|verification]] procedures, and (e) revision of mathematical models in the light of new information collected from physical experiments and field ...5 KB (730 words) - 04:59, 22 March 2023
- ...to succeed.{{sfn | Kogler | Traxler | 2017 | p=378}} Apparently first used in 1986{{sfn | Kogler | Traxler | 2017 | p=380}} by Jerrum et al.{{sfn | Jerru ...over the same data.{{sfn | Wang | Han | 2015 | pp=17-18 | loc=Median Trick in Boosting Confidence}} ...4 KB (550 words) - 23:14, 30 January 2025
- ...n Flight by Hamid Naderi Yeganeh.jpg|thumb|300x300px|A version of ''A Bird in Flight'' made up of 500 line segments]] ...t by Hamid Naderi Yeganeh 2016.jpg|300px|thumb|Another version of ''A Bird in Flight'' made up of 20,001 circles]] ...9 KB (1,243 words) - 19:05, 18 August 2024