Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete | NobleID

Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

v1

Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete

Identifier:nobleid.org/w1/20260515/1ADA32FE

Type:Journal Article

0 views

Support unavailableClaim Your Authorship

View Original Paper Source

Embeddable Badge

[![NobleID](https://www.nobleid.org/api/badge/1ADA32FE.svg?ark=w1%2F20260515%2F1ADA32FE)](https://nobleid.org/work/w1/20260515/1ADA32FE)

ARK Inflections

Metadata Policy

Metadata Formats

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors

Jaroslav Nešetřil

Claim authorship of this work

info@nobleid.org

About FAQ Terms Policy Persistence & Resolver Service Policy