522 search results - page 6 / 105 » On the Hardness of the Noncommutative Determinant |
HAPTICS
2006
IEEE
14 years 1 months ago
2006
IEEE
At first glance, multi-element forearm mounted vibrotactile displays would appear to have considerable potential as an output device for mobile computing. The devices are small, r...
FOCS
2000
IEEE
14 years 8 days ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
MASCOTS
2008
13 years 9 months ago
2008
The increasing storage capacity and necessary redundancy of data centers and other large-scale IT facilities has drawn attention to the issue of reducing the power consumption of ...
MFCS
2007
Springer
14 years 2 months ago
2007
Springer
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
ICFCA
2010
Springer
14 years 2 months ago
2010
Springer
We investigate the complexity of enumerating pseudo-intents in the lectic order. We look at the following decision problem: Given a formal context and a set of n pseudo-intents det...