scientific article; zbMATH DE number 1962829

MaRDI QIDQ4418666zbMATH OpenFDO

Authors Andrei Krokhin, Benoît Larose

Publication date 11 August 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2607/26070379.htm

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• A complexity dichotomy for poset constraint satisfaction
• A complexity dichotomy for poset constraint satisfaction
• scientific article; zbMATH DE number 2086640
• scientific article; zbMATH DE number 1670830
• Classifying the Complexity of Constraints Using Finite Algebras

Cited in

(5)

• Majority constraints have bounded pathwidth duality
• A complexity dichotomy for poset constraint satisfaction
• scientific article; zbMATH DE number 1405617 (Why is no real title available?)
• Solving simplification ordering constraints
• A complexity dichotomy for poset constraint satisfaction

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418666)