Search results

...ents, in [[polynomial time]]. This is of importance for many problems in [[computational geometry]], since the computation of the [[Euclidean distance]] between two ...#91;1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science|isbn=978-0-8186-2445-2|s2cid=195840518 |url=https://refubium.fu-berlin.de/h ...

==Computational complexity== ...le=Generating All Vertices of a Polyhedron Is Hard |journal=[[Discrete and Computational Geometry]] |volume=39 |number=1–3 |date=March 2008 |pages=174–190 |doi= 10. ...

'''Mahaney's theorem''' is a theorem in [[computational complexity theory]] proven by Stephen Mahaney that states that if any [[spa | publisher=[[Springer Science+Business Media|Springer]] ...

...|title=Sampling assumptions in inductive generalization |journal=Cognitive Science |year=2012 |volume=36 |issue=2 |pages=187–223 |doi=10.1111/j.1551-6709.2011 ...

...nal complexity theory]], an '''integer circuit''' is a [[circuit (computer science)|circuit]] [[model of computation]] in which inputs to the circuit are [[se ...is in the output of the circuit ''C'' when provided with input ''X''. The computational complexity of this problem depends on the type of gates allowed in the circ ...

...r Physics Laboratory at the [[Riken]] Nishina Center for Accelerator-Based Science,{{r|riken}} and a professor of physics at [[Tohoku University]].{{r|tohoku} ...was the 2013 winner of the [[Saruhashi Prize]],{{r|saru1}} for "developing computational methods for precise solutions of quantum <math>n</math>-body problems".{{r| ...

..., and orthogonal surfaces|book-title= Graph Theoretic Concepts in Computer Science|pages= 266–278}}</ref> ...ao Graph and its Applications| journal =[[Computational Geometry (journal)|Computational Geometry]]| volume =77| pages = 10–26 | year = 2019| doi = 10.1016/j.comge ...

{{Short description|Computer science theorem}} The '''union theorem''' is a result from the 60s in [[computational complexity theory]]. It was published<ref name="MM"> ...

In [[theoretical computer science]], a '''crossing sequence at boundary ''i''''', denoted as <math> \mathcal{ Study of crossing sequences is carried out, e.g., in [[computational complexity theory]]. ...

..., Partial Differential Equations for [[Computational science|Computational Science]]: With Maple and [[Vector Analysis]] Springer, 1998 {{ISBN|9780387983004}} ...

In [[mathematical logic]] and [[computer science]], '''two-variable logic''' is the [[fragment (logics)|fragment]] of [[firs ...isfiability (logics)|finite satisfiability]], are [[decidability (computer science)|decidable]].<ref>E. Grädel, P.G. Kolaitis and M. Vardi, ''On the Decision ...

In [[linguistics]] and [[theoretical computer science]], '''literal movement grammars (LMGs)''' are a grammar formalism intended ...ha</math> for some non-terminal <math>S</math> and some [[string (computer science)|string]] of terminals and/or non-terminals <math>\alpha</math>, an LMG rew ...

| fields = [[Theoretical computer science]] | alma_mater = [[Bachelor of Science|SB]]: [[Massachusetts Institute of Technology]] <br /> ...

In [[computational geometry]], the positive and negative '''Voronoi poles''' of a [[cell (geom | title = Proceedings of the Fourteenth Annual Symposium on Computational Geometry, Minneapolis, Minnesota, USA, June 7–10, 1998 ...

...time'' is measured, and how the ''input size'' is measured. Two prominent computational models are the [[Turing machine|Turing-machine]] model and the [[Arithmetic == Computational models == ...

...ics International Workshop on Verification and Validation in Computational Science University of Notre Dame 17–19 October 2011.</ref> and specific technical r ...ka I. Methodology of model development in the applied sciences. Journal of Computational and Applied Mechanics. 16(2), 75--86, 2021. DOI: 10.32973/jcam.2021.005 [ht ...

...r|date=2015|title=On graphs that are not PCGs|journal=Theoretical Computer Science|volume=571|pages=78–87|doi=10.1016/j.tcs.2015.01.011|s2cid=17290164 |issn=0 ...first2=J. Ian|last3=Phillips|first3=Derek|series=Lecture Notes in Computer Science |volume=2812 |doi=10.1007/978-3-540-39763-2_14 }}</ref> ...

...ng the full memory as a "catalyst", a non-consumed factor critical for the computational "reaction" to succeed.<ref name=":0" /> [[Category:Computer science]] ...

...edu/about/our-history/ |access-date=28 February 2022 |website=Committee on Computational and Applied Mathematics (CCAM)}}</ref> ...

# David Betounes, Partial Differential Equations for Computational Science: With Maple and Vector Analysis Springer, 1998 {{ISBN|9780387983004}} ...