2025-02-23T09:43:12-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-87194%22&qt=morelikethis&rows=5
2025-02-23T09:43:12-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-87194%22&qt=morelikethis&rows=5
2025-02-23T09:43:12-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-23T09:43:12-05:00 DEBUG: Deserialized SOLR response
New minimization method of logical functions in polynomial set-theoretical format. 1. Generalized rules of conjuncterms simplification
A generalized simplify rules of conjuncterms in polynomial set-theoretical format is considered. These rules are based on the proposed theorems for different initial transform condition of pair conjuncterms where hamming distance between them can be arbitrary. These rules may be useful to minimize i...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Міжнародний науково-навчальний центр інформаційних технологій і систем НАН та МОН України
2015
|
| Series: | Управляющие системы и машины |
| Subjects: | |
| Online Access: | http://dspace.nbuv.gov.ua/handle/123456789/87194 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | A generalized simplify rules of conjuncterms in polynomial set-theoretical format is considered. These rules are based on the proposed theorems for different initial transform condition of pair conjuncterms where hamming distance between them can be arbitrary. These rules may be useful to minimize in polynomial set-theoretical format of arbitrary logic functions of n variables. Advantages of the proposed rules are illustrated by the examples. |
|---|