Tight Lower Bounds for the Workflow Satisfiability Problem Based on the Strong Exponential Time Hypothesis

Information Processing Letters - Netherlands
doi 10.1016/j.ipl.2015.11.008
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Exponential Lower Bounds for the Pigeonhole Principle

1992English

On Lower Bounds of Exponential Frames

Journal of Fourier Analysis and Applications
MathematicsApplied MathematicsAnalysis
1999English

Pattern Backtracking Algorithm for the Workflow Satisfiability Problem With User-Independent Constraints

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Tight Bounds for the Subspace Sketch Problem With Applications

2020English

Comparison-Based Time–Space Lower Bounds for Selection

2009English

Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Tight Upper and Lower Bounds on the Path Length of Binary Trees

SIAM Journal on Computing
MathematicsComputer Science
1994English

New Lower Bounds for Hopcroft's Problem

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1996English

Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy