Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Hannes Ihalainen"'
Publikováno v:
Automated Reasoning ISBN: 9783031107689
The study of clause redundancy in Boolean satisfiability (SAT) has proven significant in various terms, from fundamental insights into preprocessing and inprocessing to the development of practical proof checkers and new types of strong proof systems
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a680a7b63c263e48a0369f10eb85efda
http://hdl.handle.net/10138/346993
http://hdl.handle.net/10138/346993
