13603 search results - page 275 / 2721 » On the Computational Complexity of Cut-Reduction |
173
click to vote
IDT
2010
15 years 5 months ago
2010
This paper examines the driving and opposing forces that are governing the current paradigm shift from a data-processing information technology environment without software intell...
201
Voted
CORR
2011
Springer
15 years 1 months ago
2011
Springer
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...
170
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper, a new fast Hartley transform (FHT) algorithmradix-22 suitable for pipeline implementation of the discrete Hartley transform (DHT) is presented. The proposed algorit...
208
click to vote
LCTRTS
2010
Springer
16 years 1 months ago
2010
Springer
Over the past decade, system architectures have started on a clear trend towards increased parallelism and heterogeneity, often resulting in speedups of 10x to 100x. Despite numer...
174
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...