The phrase "arithmetic intensive" is correct and usable in written English.
It can be used to describe tasks, processes, or activities that require a significant amount of arithmetic calculations or operations.
Example: "The new software is designed to be arithmetic intensive, allowing users to perform complex calculations quickly and efficiently."
Alternatives: "calculation heavy" or "math intensive".
Perhaps this helps to explain why the arithmetic-intensive profession of banking was invented in Italy.
First, they need computationally intensive arithmetic vector operations, second, the set implementations require a huge amount of memory and general purpose processors.
The pairing can be computed very efficiently on hyperelliptic curves of genus 2. In this paper it is demonstrated that the ηT method is ideally suited for hardware implementation since much of the more intensive arithmetic can be performed in parallel in hardware.
These mathematical operations are computationally intensive and fundamental arithmetic operations which are intensively used in many fields including cryptography, number theory, finite field arithmetic, and so on.
From their origins as models of problem solving, production systems have grown to become a major formalism for modeling cognitive skill and aspects of learning, in areas such as written arithmetic, reading, and knowledge-intensive areas of expertise such as chess playing and medical diagnosis.
AxleDB can perform a large subset of SQL queries through its set of instructions that can map compute-intensive database operations, such as filter, arithmetic, aggregate, group by, table join, or sort, on to the specialized high-throughput accelerators.
Simulation of seismic wave propagation is a memory intensive problem which involves a large amount of data transfer between the memory and the arithmetic units, while the number of arithmetic computations is relatively small.
The intensive memory access demand in the syntax element coding stage is lowered by using the proposed arithmetic table elimination technique.
In order to overcome the intensive polynomial reduction needed in Groebner basis computation so that we can deal with verifying large arithmetic circuits, the fanout-free regions (cones) of the circuit are extracted and represented as corresponding polynomials automatically.
