A URSA/SAT workflow specifies NP problems as certificate checkers and verifies NP-reductions for all instances up to a chosen size, covering full correctness in some cases and soundness in others.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems
A URSA/SAT workflow specifies NP problems as certificate checkers and verifies NP-reductions for all instances up to a chosen size, covering full correctness in some cases and soundness in others.