Pages that link to "Item:Q328681"

The following pages link to Algorithms for the workflow satisfiability problem engineered for counting constraints (Q328681):

Displaying 2 items.

• Tight lower bounds for the workflow satisfiability problem based on the strong exponential time hypothesis (Q903190) (← links)
• On the satisfiability of authorization requirements in business process (Q1712553) (← links)