Results 211 to 220 of about 37,386 (261)
Synthesis of a reversible quantum Vedic multiplier on IBM quantum computers. [PDF]
Sci RepNoorallahzadeh M, Mosleh M.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
IEEE Transactions on Computers, 1970
A number of schemes for implementing a fast multiplier are presented and compared on the basis of speed, complexity, and cost. A parallel multiplier designed using the carry-save scheme and constructed from 74 series integrated circuits is described. This multiplier multiplies 10-bit by 12-bit binary numbers with a worst- case multiplication time of ...
Habibi, A., Wintz, P. A.
openaire +1 more source
A number of schemes for implementing a fast multiplier are presented and compared on the basis of speed, complexity, and cost. A parallel multiplier designed using the carry-save scheme and constructed from 74 series integrated circuits is described. This multiplier multiplies 10-bit by 12-bit binary numbers with a worst- case multiplication time of ...
Habibi, A., Wintz, P. A.
openaire +1 more source
SIAM Journal on Algebraic Discrete Methods, 1985
This article is reviewed together with Part I (ibid. 6, 592-611 (1985; reviewed above).
openaire +1 more source
This article is reviewed together with Part I (ibid. 6, 592-611 (1985; reviewed above).
openaire +1 more source
2005
Abstract By the time a trial date is reached, or the date of a determined effort to compromise a claim, it should be possible to calculate accurately the financial losses that have already been suffered by the claimant. The assessment of future loss and expense will, however, be uncertain.
+4 more sources
Abstract By the time a trial date is reached, or the date of a determined effort to compromise a claim, it should be possible to calculate accurately the financial losses that have already been suffered by the claimant. The assessment of future loss and expense will, however, be uncertain.
+4 more sources