612 search results - page 31 / 123 » Hardness assumptions in the foundations of theoretical compu... |
ACMSE
2006
ACM
14 years 1 months ago
2006
ACM
In this paper, we propose several methods to increase the difficulty of reverse engineering applications, with special emphasis on preventing the circumvention of copy protection ...
FOCS
1990
IEEE
13 years 11 months ago
1990
IEEE
We show a sharp dichotomy between systems of identical automata with a symmetric global control whose behavior is easy to predict, and those whose behavior is hard to predict. The...
BIRTHDAY
2008
Springer
13 years 9 months ago
2008
Springer
Sets play a key role in foundations of mathematics. Why? To what extent is it an accident of history? Imagine that you have a chance to talk to mathematicians from a far-away plane...
MFCS
2010
Springer
13 years 6 months ago
2010
Springer
We consider evaluating one bilinear form defined by a sparse Ny × Nx matrix A having h entries on w pairs of vectors The model of computation is the semiring I/O-model with main ...
Book
"Much of the motivation and effort for this edition is to bring the book up to date with the Java JDK 1.4 release of the language. However, it has also become clear that most ...