The Minimum Equivalent DNF Problem and Shortest Implicants

Journal of Computer and System Sciences - United States
doi 10.1006/jcss.2001.1775
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Efficient Algorithms for the Minimum Shortest Path Steiner Arborescence Problem With Applications to VLSI Physical Design

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
ElectricalSoftwareComputer GraphicsComputer-Aided DesignElectronic Engineering
1998English

Efficient Heuristics for the Minimum Shortest Path Steiner Arborescence Problem With Applications to VLSI Physical Design

1997English

Conditional Inequalities and the Shortest Common Superstring Problem

International Journal of Foundations of Computer Science
Computer Science
2005English

Approximation Algorithms for the Shortest Superstring Problem.

English

On Reoptimization of the Shortest Common Superstring Problem

Applied Mathematical Sciences
2013English

The Quadratic Shortest Path Problem: Complexity, Approximability, and Solution Methods

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2018English

The Shortest Path Problem for a Multiple Graph

Modeling and Analysis of Information Systems
2017English

The Minimum K-Cover Problem

Applied Mathematical Sciences
2013English

Public-Key Cryptosystems From the Worst-Case Shortest Vector Problem

2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy