1410 search results - page 257 / 282 » Proving theorems by reuse |
IFIP12
2009
13 years 7 months ago
2009
: Component-based software development has matured into standard practice in software engineering. Among the advantages of reusing software modules are lower costs, faster developm...
STOC
2010
ACM
14 years 7 months ago
2010
ACM
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
JCT
2010
13 years 8 months ago
2010
A linear equation L is called k-regular if every k-coloring of the positive integers contains a monochromatic solution to L. Richard Rado conjectured that for every positive intege...
POPL
2009
ACM
14 years 10 months ago
2009
ACM
Transactional memory (TM) is a promising paradigm for concurrent programming. Whereas the number of TM implementations is growing, however, little research has been conducted to p...
STOC
2009
ACM
14 years 10 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...