Searching for "On Computations with Integer Division." – sorted by Relevance.
-
Arithmetic Circuit Complexity and Motion Planning
- it is impossible to compute integer division with constant depth, unbounded fanin AND/OR circuits, we show
- Add To MetaCart
-
NC1 Division
- division is simply the computation of the quotient bx=yc of integers x and y. It has been known for some
- Add To MetaCart
-
Optimal Size Integer Division Circuits
- OPTIMAL SIZE INTEGER DIVISION CIRCUITS JOHN H. REIF y AND STEPHEN R. TATE y Abstract. Division
- Cited by 10 (2 self) – Add To MetaCart
-
Execution of Functional Programs
- for computing integer divisions and remainders, min and max for computing minima and maxima, abs for computing
- Add To MetaCart
-
Testing Conformance of a Deterministic Implementation against a Non-Deterministic Stream X-Machine
- if additional iterations are required to compute the integer division result by repeated subtraction
- Cited by 3 (0 self) – Add To MetaCart
-
unknown title
- are required to compute the integer division result by repeated subtraction. If the accumulator value is less
- Add To MetaCart
-
The Java Language Specification
- -negative value of n, this is equivalent to truncating integer division, as computed by the integer division
- Add To MetaCart
-
A Protected Division Algorithm
- mod p i , for i = 1; 2. An algorithm commonly used for computing integer divisions is the classical
- Cited by 2 (0 self) – Add To MetaCart
-
A Protected Division Algorithm
- to the exponentiation x d mod pi, for i = 1, 2. An algorithm commonly used for computing integer divisions
- Add To MetaCart
-
On the Search for Tractable Ways of Reasoning about Programs
- (propositions) which relate values of variables. For example, in Floyd's sample program which computes integer
- Cited by 9 (1 self) – Add To MetaCart

