Reasoning About NP-complete Constraints | Zendy

AI Assistant Blog Pricing

Open 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

Empowering knowledge with every search

About

About Careers Publisher Partners Contact Us

Learn

FAQs Blog Terms of Use Privacy Policy

Discover

Explore

Copyright Knowledge E © 2025. All Rights Reserved.