Propositional Satisfiability Algorithms in EDA Applications

Mukul Ranjan Prasad

EECS Department, University of California, Berkeley

Technical Report No. UCB/ERL M01/39

2001

This publication is archived. It is kept only for reference purposes, so it is no longer being updated and may not meet accessibility standards. If you need this content in a different format, please email webteam@eecs.berkeley.edu.

http://www2.eecs.berkeley.edu/Pubs/TechRpts/2001/Archive/ERL-01-39.pdf

Advisors: Robert K. Brayton

BibTeX citation:

@phdthesis{Prasad:M01/39,
    Author= {Prasad, Mukul Ranjan},
    Title= {Propositional Satisfiability Algorithms in EDA Applications},
    School= {EECS Department, University of California, Berkeley},
    Year= {2001},
    Month= {Dec},
    Url= {http://www2.eecs.berkeley.edu/Pubs/TechRpts/2001/8455.html},
    Number= {UCB/ERL M01/39},
}

EndNote citation:

%0 Thesis
%A Prasad, Mukul Ranjan 
%T Propositional Satisfiability Algorithms in EDA Applications
%I EECS Department, University of California, Berkeley
%D 2001
%@ UCB/ERL M01/39
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/2001/8455.html
%F Prasad:M01/39