Pradeep Kumar Jaswal

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Satisfiability Techniques helps in deciding if there is a truth assignment for the symbols that appear in a Boolean function such that it assigns the value true to the Boolean Function. However satisfiability can be proved using Truth Tables, but design of truth table for a Boolean function of large number of variables is trivial. SAT algorithms have to(More)
  • 1