On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem (2013)
Attributed to:
Parameterized Algorithmics for the Analysis and Verification of Constrained Workflow Systems
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1145/2487222.2487226
Publication URI: http://dx.doi.org/10.1145/2487222.2487226
Type: Journal Article/Review
Parent Publication: ACM Transactions on Information and System Security
Issue: 1