4940 search results - page 135 / 988 » On the Complexity of Universal Programs |
128
click to vote
ECCC
2002
15 years 4 months ago
2002
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...
122
click to vote
CCE
2010
15 years 2 months ago
2010
The paper examines the applicability of mathematical programming methods to the simultaneous optimization of the structure and the operational parameters of a combined-cycle-based...
113
click to vote
FOSSACS
2009
Springer
15 years 11 months ago
2009
Springer
traction for Reduced ML Andrzej S. Murawski and Nikos Tzevelekos Oxford University Computing Laboratory Wolfson Building, Parks Road, Oxford OX1 3QD, UK We present the first effe...
129
click to vote
ESOP
2005
Springer
15 years 10 months ago
2005
Springer
: Fully abstract trace semantics for a core Java language. Alan Jeffrey 1,2 and Julian Rathke3 1 Bell Labs, Lucent Technologies, Chicago, IL, USA 2 DePaul University, Chicago, IL, ...
150
click to vote
ICFP
1997
ACM
15 years 8 months ago
1997
ACM
d Abstract) Allyn Dimock Harvard University Robert Muller Boston College Franklyn Turbak Wellesley College J. B. Wells∗ Glasgow University Topic Areas: compilation, lambda calcul...