群类群与计算机算法

2015 IEEE 22nd Symposium on Computer Arithmetic Pub Date : 1972-05-15 DOI:10.1109/ARITH.1972.6153886

H. Garner, N. Foo, L. Hsieh

{"title":"群类群与计算机算法","authors":"H. Garner, N. Foo, L. Hsieh","doi":"10.1109/ARITH.1972.6153886","DOIUrl":null,"url":null,"abstract":"Overflow detection and overflow recovery imposed no particular requirements on the structure of (X, X 1 < X 1 , f x ). In particular, if f is associative and commutative, overflow recovery is obtainable even if f x is neither associative or commutative.","PeriodicalId":6526,"journal":{"name":"2015 IEEE 22nd Symposium on Computer Arithmetic","volume":"83 1","pages":"1-14"},"PeriodicalIF":0.0000,"publicationDate":"1972-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Groupoids and computer arithmetic\",\"authors\":\"H. Garner, N. Foo, L. Hsieh\",\"doi\":\"10.1109/ARITH.1972.6153886\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Overflow detection and overflow recovery imposed no particular requirements on the structure of (X, X 1 < X 1 , f x ). In particular, if f is associative and commutative, overflow recovery is obtainable even if f x is neither associative or commutative.\",\"PeriodicalId\":6526,\"journal\":{\"name\":\"2015 IEEE 22nd Symposium on Computer Arithmetic\",\"volume\":\"83 1\",\"pages\":\"1-14\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1972-05-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE 22nd Symposium on Computer Arithmetic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ARITH.1972.6153886\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 22nd Symposium on Computer Arithmetic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARITH.1972.6153886","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

溢流检测和溢流恢复对(X, x1 < x1, fx)的结构没有特别的要求。特别地，如果f是结合能交换的，即使f x既不是结合能也不是交换的，也可以得到溢出恢复。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Groupoids and computer arithmetic

Overflow detection and overflow recovery imposed no particular requirements on the structure of (X, X 1 < X 1 , f x ). In particular, if f is associative and commutative, overflow recovery is obtainable even if f x is neither associative or commutative.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2015 IEEE 22nd Symposium on Computer Arithmetic

自引率

0.00%

发文量