33rd Design Automation Conference Permission to make digital/hard copy of all...  Home/Search
Context Related
| synopsys.com/news/...oud_covering.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: synopsys.com/news/pub...ATG_index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The set covering problem and the minimum cost assignment problem (respectively known as unate and binate covering problem) arise throughout the logic synthesis flow. This paper investigates the complexity and approximation ratio of two lower bound computation algorithms from both a theoretical and practical point of view. It also presents a new pruning technique that takes advantage of the partitioning. 1 Introduction The (unate or binate) covering problem is a well known intractable problem. ... (Update)
Context of citations to this paper: More
...the essential columns found form a minimal solution. Otherwise, the problem can be solved exactly by branch and bound algorithm [11]. In this scheme, a high lower bound and a low upper bound on the optimal solution are extremely effective in terminating useless searches....
...in the ability to solving large and complex instances of BCP. Examples of these techniques include, among others, partitioning [3], limit lower bound [4] negative thinking [8] for unate covering) and linear programming lower bounds [10] Despite these improvements,...
Cited by: More
Models and Algorithms for Optimization Problems in Digital.. - Flores (2001) (Correct)
On Implementing More Efficient SAT Data Structures - Lynce, Marques-Silva (Correct)
Circular BIST with State Skipping - Touba (2002) (Correct)
Similar documents (at the sentence level):
11.2%: On Solving Binate Covering Problems - Coudert (1996) (Correct)
Active bibliography (related documents): More All
0.0: On the Performance of Polynomial-time CLIQUE Approximation.. - Homer, Peinado (1993) (Correct)
0.0: Hard Graphs for Randomized Subgraph Exclusion Algorithms - Peinado (1994) (Correct)
0.0: Computing Maximally Separated Sets in the Plane and.. - Agarwal, Overmars.. (2003) (Correct)
Similar documents based on text: More All
0.5: Espresso-HF: A Heuristic Hazard-Free Minimizer for Two-Level .. - Theobald, Nowick, Wu (Correct)
0.4: Power Estimation of Cell-Based CMOS Circuits - Bogliolo, Benini, al. (2002) (Correct)
0.4: A Parellel Precorrected FFT Basec Capacitance Extraction.. - Aluru, Nadkarni, White (Correct)
Related documents from co-citation: More All
9: A computing procedure for quantification theory (context) - Davis, Putnam - 1960
9: GRASP---A New Search Algorithm for Satisfiability - Silva, Sakallah - 1996
8: Using CSP look-back techniques to solve real-world SAT instances - Bayardo, Schrag - 1997
BibTeX entry: (Update)
O. Coudert, "On Solving Covering Problems," in Proceedings of the Design Automation Conference, June 1996. http://citeseer.ist.psu.edu/article/coudert96solving.html More
@inproceedings{ coudert96solving,
author = "Olivier Coudert",
title = "On Solving Covering Problems",
booktitle = "Design Automation Conference",
pages = "197-202",
year = "1996",
url = "citeseer.ist.psu.edu/article/coudert96solving.html" }
Citations (may not include all citations):104 Approximating Maximum Independent Sets by Excluding Subgraph.. - Boppana, Halld'orsson
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.synopsys.com/news/pubs/research/ATG_index.html): More
A Design and Validation System for Asynchronous Circuits - Peter Vanbekbergen Albert (1995) (Correct)
Fault Tree Analysis: 1020 Prime Implicants and Beyond - Coudert, Madre (1993) (Correct)
New Algorithms for Gate Sizing: A Comparative Study - Coudert, Haddad, Manne (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC