Automating Resolution Is NP-Hard

doi 10.1109/focs.2019.00038
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IEEE

Related search

Optimizing Pred(25) Is NP-Hard

Studies in Systems, Decision and Control
ControlSystems EngineeringFinanceAutomotive EngineeringDecision SciencesEconomicsEconometricsOptimizationComputer ScienceSocial Sciences
2017English

Tile-Packing Tomography Is $\Mathbb{NP}$ -Hard

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2011English

Computing the Interleaving Distance Is NP-Hard

Foundations of Computational Mathematics
MathematicsComputational MathematicsApplied MathematicsAnalysisComputational Theory
2019English

Maximum Algebraic Connectivity Augmentation Is NP-hard

Operations Research Letters
IndustrialApplied MathematicsManufacturing EngineeringManagement ScienceOperations ResearchSoftware
2008English

Detecting Mixed-Unitary Quantum Channels Is NP-hard

Quantum
2020English

Linear Programming With Inexact Data Is NP-Hard

ZAMM Zeitschrift für Angewandte Mathematik und Mechanik
Computational MechanicsApplied Mathematics
1998English

Approximating Good Simultaneous Diophantine Approximations Is Almost NP-hard

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1996English

Finding the Minimum Number of Face Guards Is NP-Hard

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2012English

Reoptimization of NP-Hard Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy