Partitioning methods for satisfiability testing on large formulas
- 1 January 1996
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Satisfiability testing with more reasoning and less guessingPublished by American Mathematical Society (AMS) ,1996
- Spectral K-way ratio-cut partitioning and clusteringIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1994
- Directed hypergraphs and applicationsDiscrete Applied Mathematics, 1993
- Test pattern generation using Boolean satisfiabilityIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992
- Algorithms for testing the satisfiability of propositional formulaeThe Journal of Logic Programming, 1989
- Optimization by Simulated AnnealingScience, 1983
- A Linear-Time Heuristic for Improving Network PartitionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970