Search results

...g machine|Turing-machine]] model and the [[Arithmetic model of computation|arithmetic model]]. A '''strongly-polynomial time algorithm''' is polynomial in both m ...nce between strongly- and weakly-polynomial time is when the inputs to the algorithms consist of integer or rational numbers. It is particularly common in [[Opti ...

|title=Handbook of Floating-Point Arithmetic }}</ref> is a [[Floating-point arithmetic|floating-point]] algorithm for computing the exact [[round-off error]] in a ...

...el is a [[model of computation]] in which a [[random-access machine]] does arithmetic and bitwise operations on a word of {{mvar|w}} bits. [[Michael Fredman]] an ...can be indexed with {{mvar|w}}-bit addresses.</ref> The model allows both arithmetic operations and [[bitwise operations]] including [[logical shift]]s to be do ...

...in particular [[Randomized algorithm#Derandomization|finding deterministic algorithms]] for PIT, is one of the most important open problems in algebraic computin ...recent results and open questions." Foundations and Trends in Theoretical Computer Science 5.3–4 (2010): 207-388.</ref> ...

...er languages that allow a function to call itself recursively |Recursion (computer science)}} ...always-halting Turing machines are called [[total Turing machine]]s or '''algorithms'''.{{sfnp|Sipser|1997}} Recursive languages are also called '''decidable''' ...

except for the fact that the [[carry (arithmetic)|carry]] .../math> and <math>(X^7\cdot X^2)+(X^5\cdot X^4)\equiv0</math> thanks to the arithmetic in GF(2). This corresponds to the columns marked <code>^</code> in the exam ...

...nch and bound|branch-and-bound]] algorithms classically used in [[Interval arithmetic|interval analysis]]. Most of them are based on interval arithmetic. ...

'''AN codes''' are [[error-correcting code]] that are used in arithmetic applications. ...rs would be unreliable since any errors would go undetected. AN codes are arithmetic codes that are named for the integers <math>A</math> and <math>N</math> tha ...

...avid |title=What every computer scientist should know about floating-point arithmetic |journal=ACM Computing Surveys |date=March 1991 |volume=23 |issue=1 |pages= ...n the ''inputs'' are approximations themselves. Indeed, in floating-point arithmetic, when the inputs are close enough, the floating-point difference is compute ...

...anch (computer science)|branch]]-free implementation, it is widely used in computer graphics applications.{{sfn|Shirley|Wald|Marrs|2021}}{{sfn|Majercik|Crassin ...e ray itself does not lie on one of the faces of the bounding box. In such arithmetic, the intersections with the planes parallel to the ray will be given by <ma ...

In [[floating-point arithmetic]], the '''Sterbenz lemma''' or '''Sterbenz's lemma'''<ref name="handbook">{ |title=Handbook of Floating-Point Arithmetic ...

...between multiple processors over a network. It is much more expensive than arithmetic.<ref name="Demmel_2012"/> A common computational model in analyzing communication-avoiding algorithms is the two-level memory model: ...

...[Matrix (mathematics)|matrix]] with [[integer]] entries using only integer arithmetic; any [[division (mathematics)|division]]s that are performed are guaranteed ...mon Factors in Fraction-Free Matrix Decompositions|journal= Mathematics in Computer Science|year=2020|volume=15|issue=4|pages=589–608|doi=10.1007/s11786-020-00 ...

...lled '''cascade summation''', is a technique to sum a sequence of finite-[[arithmetic precision|precision]] [[floating-point]] numbers that substantially reduces ...emented so as to have nearly the same cost (and exactly the same number of arithmetic operations) as naive summation. ...

...und for pps would rule out existence of a certain class of polynomial-time algorithms based on that pps. ...ms based on resolution includes most of current propositional proof search algorithms and modern industrial SAT solvers. ...

'''Mixed-precision arithmetic''' is a form of [[floating-point arithmetic]] that uses numbers with varying widths in a single operation. ...In this way, mixed-precision arithmetic approximates [[arbitrary-precision arithmetic]], albeit with a low number of possible precisions. ...

In [[theoretical computer science]], a [[function (mathematics)|function]] <math>f(n)</math> is said ...the inputs to a problem that, when present, lead to good performance from algorithms on those inputs.{{r|pareto}} It can also bound the size of the output for s ...

{{short description|Subfield of computer science}} ...respects, analysis of [[parallel algorithm]]s is similar to [[analysis of algorithms|the analysis]] of [[sequential algorithm]]s, but is generally more involved ...

..., whereas Color Cell Compression does not use the standard deviation. Both algorithms, though, can compress an image down to effectively 2 bits per pixel. ::# The image is now subdivided into 4-pixel by 4-pixel blocks, and, the [[arithmetic mean]] of the luminance of each pixel in the block is used to select a repr ...

...quence design, a '''Feedback with Carry Shift Register''' (or FCSR) is the arithmetic or with carry analog of a [[linear-feedback shift register]] (LFSR). If <m |journal=ACM Transactions on Modeling and Computer Simulation ...