Boolean Satisfiability in Quantum Compilation

Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences - United Kingdom
doi 10.1098/rsta.2019.0161
Full Text
Abstract

Available in full text

Date
Authors
Publisher

The Royal Society

Related search

Boolean Satisfiability With Transitivity Constraints

ACM Transactions on Computational Logic
Computational MathematicsTheoretical Computer ScienceComputer ScienceLogic
2002English

Shatter: Efficient Symmetry-Breaking for Boolean Satisfiability

English

On Generic Np-Completeness of the Boolean Satisfiability Problem

Prikladnaya Diskretnaya Matematika
Signal ProcessingCombinatoricsApplied MathematicsMathematicsDiscrete MathematicsComputational TheoryTheoretical Computer Science
2017English

A Logical Deduction Based Clause Learning Algorithm for Boolean Satisfiability Problems

International Journal of Computational Intelligence Systems
Computational MathematicsComputer Science
2017English

Bi-Decomposing Large Boolean Functions via Interpolation and Satisfiability Solving

2008English

Exact Minimum Factoring of Incompletely Specified Logic Functions via Quantified Boolean Satisfiability

IPSJ Transactions on System LSI Design Methodology
Electronic EngineeringComputer Science ApplicationsElectrical
2011English

Symmetry Detection for Large Boolean Functions Using Circuit Representation, Simulation, and Satisfiability

Proceedings - Design Automation Conference
ControlSystems EngineeringElectronic EngineeringSimulationHardwareComputer Science ApplicationsElectricalArchitectureModeling
2006English

Quantum Identification of Boolean Oracles

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Classical and Quantum Annealing in the Median of Three-Satisfiability

Physical Review A
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy