2214 search results - page 112 / 443 » Complexity of Reasoning |
127
click to vote
CSL
2010
Springer
15 years 4 months ago
2010
Springer
We introduce two-sorted theories in the style of [CN10] for the complexity classes L and DET, whose complete problems include determinants over Z2 and Z, respectively. We then desc...
111
click to vote
DLOG
2009
15 years 4 months ago
2009
Abstract There are various techniques for specifying a module of an ontology that covers all knowledge about a given set of terms. These differ with respect to the size of the modu...
EUROPAR
2007
Springer
15 years 9 months ago
2007
Springer
We present in detail a GCA (Global Cellular Automaton) algorithm with 3n cells for Hirschberg’s algorithm which determines the connected components of a n-node undirected graph w...
118
Voted
IJCNN
2008
IEEE
15 years 9 months ago
2008
IEEE
—Modeling of complex phenomena such as the mind presents tremendous computational complexity challenges. The neural modeling fields theory (NMF) addresses these challenges in a n...
115
Voted
TARK
2007
Springer
15 years 9 months ago
2007
Springer
We introduce ATLES – a variant of ATL with explicit names for strategies in the object language. ATLES makes it possible to refer to the same strategy in different occurrences o...