10392 search results - page 1645 / 2079 » Introduction to Computer Science |
173
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
172
click to vote
FCT
2009
Springer
16 years 1 months ago
2009
Springer
Entanglement is a complexity measure for directed graphs that was used to show that the variable hierarchy of the propositional modal µ-calculus is strict. While graphs of entangl...
172
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
We study the problem of polynomial identity testing (PIT) for depth 2 arithmetic circuits over matrix algebra. We show that identity testing of depth 3 (ΣΠΣ) arithmetic circuit...
173
click to vote
GROUP
2009
ACM
16 years 1 months ago
2009
ACM
Previous research has explored how technology can motivate healthy living in social groups such as friends and coworkers. However, little research has focused on the implications ...
156
click to vote
SIGECOM
2009
ACM
16 years 1 months ago
2009
ACM
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...