Sciweavers

7106 search results - page 274 / 1422
» Restricted Complexity, General Complexity
Sort
View
154
Voted
DLOG
2011
14 years 8 months ago
Unchain My EL Reasoner
We study a restriction of the classification procedure for EL++ where the inference rule for complex role inclusion axioms (RIAs) is applied in a “left-linear” way in analogy ...
Yevgeny Kazakov, Markus Krötzsch, Frantisek S...
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 4 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
CHI
2010
ACM
15 years 11 months ago
Apatite: a new interface for exploring APIs
We present Apatite, a new tool that aids users in learning and understanding a complex API by visualizing the common associations between its various components. Current object-or...
Daniel S. Eisenberg, Jeffrey Stylos, Brad A. Myers
STACS
2009
Springer
15 years 11 months ago
Tractable Structures for Constraint Satisfaction with Truth Tables
The way the graph structure of the constraints influences the complexity of constraint satisfaction problems (CSP) is well understood for bounded-arity constraints. The situation...
Dániel Marx
123
Voted
ICC
2009
IEEE
125views Communications» more  ICC 2009»
15 years 11 months ago
Cryptanalysis of Substitution Cipher Chaining Mode (SCC)
In this paper, we present an enhanced cryptanalysis of the Substitution Cipher Chaining mode (SCC) [1]. In [2], SCC-128 (SCC which uses AES with 128-bit key) was broken using 5 att...
Mohamed Abo El-Fotouh, Klaus Diepold