Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization

DOI10.1016/S0166-218X(98)00114-0zbMath0913.68103DBLPjournals/dam/BorosHMR99WikidataQ56288388 ScholiaQ56288388MaRDI QIDQ1276959

Peter L. Hammer, David J. jun. Rader, Endre Boros, Michel Minoux

Publication date: 25 May 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

VLSI designcell flipping

Mathematics Subject Classification ID

Computer science aspects of computer-aided design (68U07) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Related Items (7)

Introduction to QUBO ⋮ Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing ⋮ Properties of quasi-Boolean function on quasi-Boolean algebra ⋮ Pseudo-Boolean optimization ⋮ On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems ⋮ Special issue: Boolean functions and related problems ⋮ Disjunctive and conjunctive normal forms of pseudo-Boolean functions

Cites Work

• Unnamed Item
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Representation of a finite graph by a set of intervals on the real line
• Roof duality, complementation and persistency in quadratic 0–1 optimization
• The orientation of modules based on graph decomposition

This page was built for publication: Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization