A Multivariate Approach for Checking Resiliency in Access Control

DOI10.1007/978-3-319-41168-2_15zbMath1478.68197arXiv1604.01550OpenAlexW2963622401MaRDI QIDQ2830068

Jason Crampton, Gregory Gutin, Rémi Watrigant

Publication date: 9 November 2016

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer security (68M25) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (3)

Parameterized Resiliency Problems via Integer Linear Programming ⋮ A Multivariate Approach for Checking Resiliency in Access Control ⋮ Parameterized resiliency problems

Cites Work

• Fundamentals of parameterized complexity
• The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness
• An application of simultaneous diophantine approximation in combinatorial optimization
• Which problems have strongly exponential complexity?
• A Multivariate Approach for Checking Resiliency in Access Control
• Integer Programming with a Fixed Number of Variables
• Incompressibility through Colors and IDs
• Minkowski's Convex Body Theorem and Integer Programming
• Parameterized Algorithms

This page was built for publication: A Multivariate Approach for Checking Resiliency in Access Control