Search results

...f [[computation time]] on an [[alternating Turing machine]] with a bounded number of alternations. It is a particular case of a [[Alternating_Turing_machine# {{Comp-sci-theory-stub}} ...

...crete mathematics)|graph]] [[reachability]] and [[Computational complexity theory#Complexity classes|complexity classes]].{{fact|date=May 2016}} ...there is an edge from one configuration to another if it corresponds to a computational step of the model.{{fact|date=May 2016}} ...

==Computational complexity== ...edron Is Hard |journal=[[Discrete and Computational Geometry]] |volume=39 |number=1–3 |date=March 2008 |pages=174–190 |doi= 10.1007/s00454-008-9050-5|doi-acc ...

...n, r_i</math> are [[natural number]]s and <math>k_i, x_i</math> are [[real number]]s. ...ents, in [[polynomial time]]. This is of importance for many problems in [[computational geometry]], since the computation of the [[Euclidean distance]] between two ...

...computing effort. It is an extension of the [[SIMPLE algorithm]] used in [[computational fluid dynamics]] to solve the Navier-Stokes equations. PISO is a pressure-v #Repeat from 3 for the prescribed number of times. ...

'''Toda's theorem''' is a result in [[computational complexity theory]] that was proven by [[Seinosuke Toda]] in his paper "PP is as Hard as the [[Sharp-P|#P]] is the problem of exactly counting the number of solutions to a polynomially-verifiable question (that is, to a question ...

...://jocg.org/index.php/jocg/about/editorialTeam Editorial Team], Journal of Computational Geometry. Retrieved 2024-01-31.</ref> ...co-chair of the [[Association for Computing Machinery|ACM]] [[Symposium on Computational Geometry]]. ...

In [[computational geometry]], the '''Yao graph''', named after [[Andrew Yao]], is a kind of [ ...me idea can be extended to point sets in more than two dimensions, but the number of sectors required grows exponentially with the dimension. ...

In [[computational complexity theory]], '''NP/poly''' is a [[complexity class]], a [[Circuit complexity|non-unif ...<math>y</math> for which <math>f(x,y)</math> is true.<ref>{{citation|title=Computational Complexity: A Modern Approach|first1= Sanjeev|last1=Arora|first2=Boaz|last2 ...

In [[coding theory]], '''triangular network coding''' ('''TNC''') is a non-linear [[network co ...linear encoding and decoding over [[GF(2)]] alleviates the concern of high computational complexity, coding over GF(2) comes at the tradeoff cost of degrading throu ...

...density in a frontier orbital, as a result of a small change in the total number of electrons.<ref>{{GoldBookRef | title = frontier function | file = FT0703 ...le are.<ref>{{cite book | isbn=9781420065435 | title = Chemical Reactivity Theory: A DFT View | year = 2010 | publisher = CRC Press | editor = Chatteraj, P. ...

...'''bipartite matroid''' is a [[matroid]] all of whose circuits have [[even number|even]] size. ...<math>U{}^r_n</math> is bipartite if and only if <math>r</math> is an odd number, because the circuits in such a matroid have size <math>r+1</math>. ...

In [[computational complexity theory]] and [[cryptography]], '''averaging argument''' is a standard argument for ...N/3</math> marks. However, since there are <math>B</math> books, the total number of marks will be fewer than <math>(NB)/3</math>, contradicting the fact tha ...

...nk.springer.com/10.1007/s41468-022-00110-9 |journal=Journal of Applied and Computational Topology |language=en |doi=10.1007/s41468-022-00110-9 |arxiv=2109.05513 |s2 ...l=https://link.springer.com/10.1007/s00454-022-00476-8 |journal=Discrete & Computational Geometry |language=en |doi=10.1007/s00454-022-00476-8 |issn=0179-5376|arxiv ...

...uter scientist)|Charles H. Bennett]] based on the [[Analysis of algorithms|computational complexity]] of an algorithm that can recreate a given piece of information ...n vs Logical Depth |url=https://doi.org/10.1007/s00224-016-9672-6 |journal=Theory of Computing Systems |language=en |volume=60 |issue=2 |pages=280–298 |doi=1 ...

{{short description|Function used in computational complexity theory}} ..., Calif.|mr=519066|title-link=Computers and Intractability: A Guide to the Theory of NP-Completeness}}</ref> ...

In [[computer science]] (specifically [[computational complexity theory]]), the '''worst-case complexity''' measures the [[system resource|resource ...ity''' of <math>\mathsf{A}</math> if, for every [[Computational complexity theory#Representing problem instances|input string]] <math>s</math>, <math>\mathsf ...

...tion of a general set by a collection of simpler subsets. In [[probability theory]] it is the approximation of one probability distribution by another. | journal = [[Discrete & Computational Geometry]] ...

In the theory of parallel algorithms, the '''1-vs-2 cycles problem''' concerns a simplifi ...[[massively parallel communication]] model requires at least a logarithmic number of rounds of communication, even for a randomized algorithm that succeeds w ...

...mpression for Specialised Information Retrieval Systems |series=Studies in Computational Intelligence |volume=283 |pages=111–121 |year=2010 |doi=10.1007/978-3-642-1 Then a desired number of words with top cumulated frequencies are chosen to build a targed lexico ...