Sciweavers

4895 search results - page 117 / 979
» Functional Quantum Programming
Sort
View
104
Voted
ICFP
2002
ACM
16 years 2 months ago
Shortcut fusion for accumulating parameters & zip-like functions
We present an alternative approach to shortcut fusion based on the function unfoldr. Despite its simplicity the technique can remove intermediate lists in examples which are known...
Josef Svenningsson
149
Voted
FP
1991
95views Formal Methods» more  FP 1991»
15 years 5 months ago
Making Functionality More General
The notion of functionality is not cast in stone, but depends upon what we have as types in our language. With partial equivalence relations (pers) as types we show that the funct...
Graham Hutton, Ed Voermans
108
Voted
DAGSTUHL
2006
15 years 3 months ago
Bounds on the Fourier Coefficients of the Weighted Sum Function
We estimate Fourier coefficients of a Boolean function which has recently been introduced in the study of read-once branching programs. Our bound implies that this function has an...
Igor Shparlinski
88
Voted
ICTAC
2007
Springer
15 years 8 months ago
Discovering Non-linear Ranking Functions by Solving Semi-algebraic Systems
Abstract. Differing from [6] this paper reduces non-linear ranking function discovering for polynomial programs to semi-algebraic system solving, and demonstrates how to apply the...
Yinghua Chen, Bican Xia, Lu Yang, Naijun Zhan, Cha...
111
Voted
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
15 years 5 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...