400 search results - page 26 / 80 » Derandomization and Distinguishing Complexity |
132
click to vote
ASPDAC
2006
ACM
15 years 8 months ago
2006
ACM
Abstract— Substantial attention is being paid to the fault diagnosis problem in recent test literature. Yet, the compaction of test vectors for fault diagnosis is little explored...
FOCS
2003
IEEE
15 years 7 months ago
2003
IEEE
We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random obj...
140
click to vote
FOCS
2002
IEEE
15 years 7 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
121
click to vote
VLC
2002
15 years 1 months ago
2002
More powerful personal computers and higher network bandwidth has meant that graphics has become increasingly important on the web. Graph-based diagrams are one of the most import...
122
click to vote
TCC
2009
Springer
16 years 2 months ago
2009
Springer
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...