Complexity of Two-Level Logic Minimization

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems - United States
doi 10.1109/tcad.2005.855944
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Related search

Complexity Results for First-Order Two-Variable Logic With Counting

SIAM Journal on Computing
MathematicsComputer Science
2000English

Proof Complexity of Propositional Default Logic

Archive for Mathematical Logic
PhilosophyLogic
2011English

Proof Complexity of Propositional Default Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Computational Complexity of Input/Output Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Empirical Risk Minimization: Probabilistic Complexity and Stepsize Strategy

Computational Optimization and Applications
ControlComputational MathematicsApplied MathematicsOptimization
2019English

The Computational Complexity of Distinctive Feature Minimization in Phonology

2018English

Complexity of Existential Positive First-Order Logic

Journal of Logic and Computation
ArtsHumanitiesHardwareArchitectureLogicTheoretical Computer ScienceSoftware
2011English

New Complexity Results for Łukasiewicz Logic

Soft Computing
GeometrySoftwareTheoretical Computer ScienceTopology
2018English

Trace Driven Logic Synthesis-Application to Power Minimization

1997English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy