Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem

DOI10.1007/978-3-319-13524-3_18zbMath1341.68059OpenAlexW2477142126MaRDI QIDQ2946020

Stefan Kratsch, Magnus Wahlström, Gregory Gutin

Publication date: 15 September 2015

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-13524-3_18

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

This page was built for publication: Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem