Computing the value of a Boolean expression with interval inputs is NP-hard
From MaRDI portal
Publication:1362918
DOI10.1023/A:1009937906231zbMath0878.68113OpenAlexW1522873526MaRDI QIDQ1362918
Publication date: 14 December 1997
Published in: Reliable Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009937906231
Interval and finite arithmetic (65G30) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)
This page was built for publication: Computing the value of a Boolean expression with interval inputs is NP-hard