1410 search results - page 257 / 282 » Proving theorems by reuse |
125
Voted
IFIP12
2009
14 years 11 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...
107
Voted
STOC
2010
ACM
15 years 11 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...
126
click to vote
JCT
2010
15 years 8 days 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...
225
Voted
POPL
2009
ACM
16 years 2 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...
122
Voted
STOC
2009
ACM
16 years 2 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...