Verification of proofs of unsatisfiability for CNF formulas | NobleID

Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

v1

Verification of proofs of unsatisfiability for CNF formulas

Identifier:nobleid.org/w1/20260525/5B2CC217

Type:Conference Paper

0 views

Support unavailableClaim Your Authorship

View Original Paper Source

Embeddable Badge

[![NobleID](https://www.nobleid.org/api/badge/5B2CC217.svg?ark=w1%2F20260525%2F5B2CC217)](https://nobleid.org/work/w1/20260525/5B2CC217)

ARK Inflections

Metadata Policy

Metadata Formats

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors

Claim authorship of this work

info@nobleid.org

About FAQ Terms Policy Persistence & Resolver Service Policy