pith. sign in

arxiv: 0910.0013 · v1 · submitted 2009-09-30 · 💻 cs.DS · cs.AI· cs.LO

Algorithms for finding dispensable variables

classification 💻 cs.DS cs.AIcs.LO
keywords algorithmsdispensablefindingvariablesbooleanbrieflyformulaheavy
0
0 comments X
read the original abstract

This short note reviews briefly three algorithms for finding the set of dispensable variables of a boolean formula. The presentation is light on proofs and heavy on intuitions.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.