484 search results - page 21 / 97 » Computing Hilbert Class Polynomials |
APLAS
2005
ACM
15 years 5 months ago
2005
ACM
Affine size-change analysis has been used for termination analysis of eager functional programming languages. The same style of analysis is also capable of compactly recording and ...
TLCA
2007
Springer
15 years 5 months ago
2007
Springer
We present a size-aware type system for first-order shapely function definitions. Here, a function definition is called shapely when the size of the result is determined exactly...
113
click to vote
TCS
2011
14 years 6 months ago
2011
The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced in 2004 and has quickly attracted significant attention with subsequent ...
112
click to vote
SIAMCOMP
1998
14 years 11 months ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
CORR
2000
Springer
14 years 11 months ago
2000
Springer
A polynomial depth quantum circuit affects, by definition, a poly-local unitary transformation of a tensor product state space. It is a reasonable belief [Fe], [L], [FKW] that, at ...