DocumentCode
3378225
Title
Comparison sets: A useful partitioning of the space of floating point operand pairs
Author
Kent, Jan G.
Author_Institution
Norwegian Computing Center Forskningsveien 1B, Oslo 3 Norway
fYear
1975
fDate
19-20 Nov. 1975
Firstpage
36
Lastpage
39
Abstract
In this paper the definition of comparison sets and a discussion of their usefulness are presented based on the research work reported in (14). In addition some new results concerning the distribution of floating point (FLP) operand pairs over comparison sets are given.
Keywords
Algorithm design and analysis; Computers; Manuals; Partitioning algorithms; Polynomials; Prediction algorithms; Programming;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Arithmetic (ARITH), 1975 IEEE 3rd Symposium on
Conference_Location
Dallas, TX, USA
Type
conf
DOI
10.1109/ARITH.1975.6156991
Filename
6156991
Link To Document