16666 search results - page 92 / 3334 » Descriptive and Computational Complexity |
121
click to vote
UC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
136
click to vote
TC
2008
15 years 3 months ago
2008
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
127
click to vote
AI
2002
Springer
15 years 3 months ago
2002
Springer
ko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, th...
152
Voted
ECCC
2011
14 years 10 months ago
2011
We consider two basic computational problems regarding discrete probability distributions: (1) approximating the statistical difference (aka variation distance) between two given d...
241
click to vote
ICDE
2003
IEEE
16 years 5 months ago
2003
IEEE
Expressing complex OLAP queries using group-by, aggregation, and joins can be extremely difficult. As a result of this, many alternate ways of expressing such queries have been de...