logo

EbookBell.com

Most ebook files are in PDF format, so you can easily read them using various software such as Foxit Reader or directly on the Google Chrome browser.
Some ebook files are released by publishers in other formats such as .awz, .mobi, .epub, .fb2, etc. You may need to install specific software to read these formats on mobile/PC, such as Calibre.

Please read the tutorial at this link:  https://ebookbell.com/faq 


We offer FREE conversion to the popular formats you request; however, this may take some time. Therefore, right after payment, please email us, and we will try to provide the service as quickly as possible.


For some exceptional file formats or broken links (if any), please refrain from opening any disputes. Instead, email us first, and we will try to assist within a maximum of 6 hours.

EbookBell Team

Reconstructability Analysis Theory And Applications Martin Zwick Guangfu Shu Yi Lin

  • SKU: BELL-51335992
Reconstructability Analysis Theory And Applications Martin Zwick Guangfu Shu Yi Lin
$ 35.00 $ 45.00 (-22%)

4.8

104 reviews

Reconstructability Analysis Theory And Applications Martin Zwick Guangfu Shu Yi Lin instant download after payment.

Publisher: Emerald Publishing Limited
File Extension: PDF
File size: 2.93 MB
Pages: 212
Author: Martin Zwick; Guangfu Shu; Yi Lin
ISBN: 9781845443917, 1845443918
Language: English
Year: 2004

Product desciption

Reconstructability Analysis Theory And Applications Martin Zwick Guangfu Shu Yi Lin by Martin Zwick; Guangfu Shu; Yi Lin 9781845443917, 1845443918 instant download after payment.

A novel many-valued decomposition within the framework of lossless reconstructability analysis (RA) is presented. In previous work, modified reconstructability analysis (MRA) was applied to Boolean functions, where it was shown that most Boolean functions not decomposable using conventional reconstructability analysis (CRA) are decomposable using MRA. Also, it was previously shown that whenever decomposition exists in both MRA and CRA, MRA yields simpler or equal complexity decompositions. In this paper, MRA is extended to many-valued logic functions, and logic structures that correspond to such decomposition are developed. It is shown that many-valued MRA can decompose manyvalued functions when CRA fails to do so. Since real-life data are often many-valued, this new decomposition can be useful for machine learning and data mining. Many-valued MRA can also be applied for the decomposition of relations.

Related Products