19320 search results - page 278 / 3864 » On the complexity of computing determinants |
155
click to vote
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
We show1 that non-deterministic time NTIME(n) is not contained in deterministic time n 2and polylogarithmic space, for any > 0. This implies that (infinitely often) satisfiabi...
173
click to vote
DCC
1993
IEEE
15 years 10 months ago
1993
IEEE
Two new algorithms for performing arithmetic coding without employing multiplication are presented. The first algorithm, suitable for an alphabet of arbitrary size, reduces the wo...
145
click to vote
BMCBI
2008
15 years 6 months ago
2008
ent> <title> <p>Highlights from the Fourth International Society for Computational Biology (ISCB) Student Council Symposium</p> </title> <editor>Lu...
172
click to vote
CC
2007
Springer
15 years 6 months ago
2007
Springer
We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is t...
190
click to vote
ISW
2010
Springer
15 years 4 months ago
2010
Springer
A Private Information Retrieval (PIR) protocol allows a database user, or client, to obtain information from a data- base in a manner that prevents the database from knowing which...