1686 search results - page 47 / 338 » Programs as polygraphs: computability and complexity |
106
click to vote
EM
2010
14 years 9 months ago
2010
In this paper we enumerate and classify the "simplest" pairs (M, G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the p...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
170
Voted
Book
""The goal of this book is to teach you to think like a computer scientist. I like the way computer scientists think because they combine some of the best features of Mat...
182
Voted
Book
"The goal of this book is to teach you to think like a computer scientist. I like the way computer scientists think because they combine some of the best features of Mathemati...
CCS
2007
ACM
15 years 3 months ago
2007
ACM
Despite the recent advances in the theory underlying obfuscation, there still is a need to evaluate the quality of practical obfuscating transformations more quickly and easily. T...