19320 search results - page 105 / 3864 » On the complexity of computing determinants |
175
click to vote
MST
2011
14 years 11 months ago
2011
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
156
Voted
ECWEB
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Alternating least squares (ALS) is a powerful matrix factorization (MF) algorithm for both implicit and explicit feedback based recommender systems. We show that by using...
129
click to vote
FSTTCS
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. This paper studies a recently developed an approach to reasoning about mutable data structures, which uses an assertion language with spatial conjunction and implication ...
143
click to vote
LATIN
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
152
click to vote
AHS
2007
IEEE
15 years 4 months ago
2007
IEEE
This paper introduces Perplexus, a European project that aims to develop a scalable hardware platform made of custom reconfigurable devices endowed with bio-inspired capabilities...