表示索引生成函数的变量数约简方法:s-Min法

2015 IEEE International Symposium on Multiple-Valued Logic Pub Date : 2015-05-18 DOI:10.1109/ISMVL.2015.40

Tsutomu Sasao

{"title":"表示索引生成函数的变量数约简方法:s-Min法","authors":"Tsutomu Sasao","doi":"10.1109/ISMVL.2015.40","DOIUrl":null,"url":null,"abstract":"Most n-variable incompletely specified index generation functions with weight k can be represented by fewer variables than n when k ≪ 2n. Furthermore, with a linear decomposition, the function can be represented by still fewer variables. In this paper, we propose an iterative improvement method, called the s-Min method, to reduce the number of variables.","PeriodicalId":118417,"journal":{"name":"2015 IEEE International Symposium on Multiple-Valued Logic","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":"{\"title\":\"A Reduction Method for the Number of Variables to Represent Index Generation Functions: s-Min Method\",\"authors\":\"Tsutomu Sasao\",\"doi\":\"10.1109/ISMVL.2015.40\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Most n-variable incompletely specified index generation functions with weight k can be represented by fewer variables than n when k ≪ 2n. Furthermore, with a linear decomposition, the function can be represented by still fewer variables. In this paper, we propose an iterative improvement method, called the s-Min method, to reduce the number of variables.\",\"PeriodicalId\":118417,\"journal\":{\"name\":\"2015 IEEE International Symposium on Multiple-Valued Logic\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-05-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"21\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE International Symposium on Multiple-Valued Logic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISMVL.2015.40\",\"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 International Symposium on Multiple-Valued Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.2015.40","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 21

摘要

当k≪2n时，大多数权重为k的n变量不完全指定指数生成函数可以用比n更少的变量表示。此外，通过线性分解，函数可以用更少的变量来表示。在本文中，我们提出了一种迭代改进方法，称为s-Min方法，以减少变量的数量。

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

查看原文本刊更多论文

A Reduction Method for the Number of Variables to Represent Index Generation Functions: s-Min Method

Most n-variable incompletely specified index generation functions with weight k can be represented by fewer variables than n when k ≪ 2n. Furthermore, with a linear decomposition, the function can be represented by still fewer variables. In this paper, we propose an iterative improvement method, called the s-Min method, to reduce the number of variables.

求助全文

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

来源期刊

2015 IEEE International Symposium on Multiple-Valued Logic

自引率

0.00%

发文量