Computing the minimum DNF representation of Boolean functions defined by intervals-Reference-Cited by-同舟云学术

Computing the minimum DNF representation of Boolean functions defined by intervals

Author:

Schieber Baruch,Geist Daniel,Zaks Ayal

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference7 articles.

1. Constraint solving for test case generation—a technique of high level design verification;Chandra,1992

3. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979

4. Solving constraint satisfiability problem for automatic generation of design verification vectors;Huang,1999

5. Constraint satisfaction for test program generation;Lewin,1995

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

2. No Efficient Disjunction or Conjunction of Switch-Lists;Journal on Satisfiability, Boolean Modeling and Computation;2022-04-26

3. Double Mask: An Efficient Rule Encoding for Software Defined Networking;2020 23rd Conference on Innovation in Clouds, Internet and Networks and Workshops (ICIN);2020-02

5. A Practical Range Encoding Scheme for TCAMs;Proceedings of the ACM SIGCOMM 2019 Conference Posters and Demos on - SIGCOMM Posters and Demos '19;2019