z-logo
HomeZAIABlog
open-access-imgOpen Access
Reasoning About NP-complete Constraints
Author(s) -
Emmanuel Hébrard
Publication year - 2018
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - Uncategorized
Resource type - Conference proceedings
Subject(s) - computer science , np complete , computational complexity theory , algorithm

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom

About

AboutCareersPublisher PartnersContact UsGet Organisational Trial or Quote

Learn

FAQsBlogTerms of UsePrivacy Policy

Download the Zendy App

Get it on
Google Play
Download on the
App Store

Discover

Explore

Copyright Knowledge E © 2026. All Rights Reserved.