13603 search results - page 290 / 2721 » On the Computational Complexity of Cut-Reduction |
203
click to vote
IJCINI
2007
15 years 6 months ago
2007
: The theme of this issue of IJCINI is on cognitive mechanisms of autonomic computing and laws of human cooperative work organization. This editorial addresses key notions of this ...
145
click to vote
MOC
1998
15 years 6 months ago
1998
We use the algorithmic computation of exact sequences of Abelian groups to compute the complete structure of (ZK /m)∗ for an ideal m of a number field K, as well as ray class gr...
235
click to vote
FPL
2010
Springer
15 years 4 months ago
2010
Springer
We demonstrate how Field Programmable Gate Arrays (FPGAs) may be used to address the computing challenges associated with assembling genome sequences from recent ultra-high-through...
221
click to vote
SIGECOM
2011
ACM
14 years 9 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
