41 search results - page 7 / 9 » Conditional hardness for satisfiable 3-CSPs |
78
Voted
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
— We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we sh...
84
Voted
ICDCS
2003
IEEE
15 years 2 months ago
2003
IEEE
Writing correct distributed programs is hard. In spite of extensive testing and debugging, software faults persist even in commercial grade software. Many distributed systems, esp...
76
Voted
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
STOC
2010
ACM
15 years 2 months ago
2010
ACM
Data streams emerged as a critical model for multiple applications that handle vast amounts of data. One of the most influential and celebrated papers in streaming is the “AMSâ...
76
Voted
WPES
2005
ACM
15 years 3 months ago
2005
ACM
This paper introduces a novel approach for augmenting attributebased access control systems in a way that allows them to offer fully anonymous access to resources while at the sam...