On the Workflow Satisfiability Problem with Class-independent Constraints

From MaRDI portal

Revision as of 00:29, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5363761

Jump to:navigation, search

DOI10.4230/LIPIcs.IPEC.2015.66zbMath1378.68069arXiv1504.03561OpenAlexW2962767718MaRDI QIDQ5363761

No author found.

Publication date: 29 September 2017

Full work available at URL: https://arxiv.org/abs/1504.03561

zbMATH Keywords

constraint satisfaction problem fixed-parameter tractability workflow satisfiability problem user-independent constraints

Mathematics Subject Classification ID

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

Related Items (1)

Parameterized Complexity of the Workflow Satisfiability Problem

This page was built for publication: On the Workflow Satisfiability Problem with Class-independent Constraints

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5363761&oldid=20072827"