Re: Fourier Transforms of Boolean Functions

Post       : Fourier Transforms of Boolean Functions : 2
URL        : http://inquiryintoinquiry.com/2013/06/04/fourier-transforms-of-boolean-functions-2/
Posted     : June 4, 2013 at 10:00 pm
Author     : Jon Awbrey
Categories : Boolean Functions, Computational Complexity, Fourier Transforms,
              Harmonic Analysis, Logic, Mathematics, Propositional Calculus

Re: Another Problem
At: http://rjlipton.wordpress.com/2013/05/21/twin-primes-are-useful/

Note.  Just another sheet of scratch paper, exploring possible alternatives
to the Fourier transforms in the previous post.  As a rule, I like to keep
Boolean problems in Boolean spaces, partly for aesthetic reasons and partly
from a sense that it doesn’t reduce the computational complexity of Boolean
problems to replace them with integer or real number problems.  I’ll begin
by copying the previous post as a template and gradually transform it as
I proceed.

Begin with a survey of concrete examples, perhaps in tabular form.

[A lot of LaTeX content that can't be shown here ... See blog post.]

-- 

academia: http://independent.academia.edu/JonAwbrey
my word press blog: http://inquiryintoinquiry.com/
inquiry list: http://stderr.org/pipermail/inquiry/
mwb: http://www.mywikibiz.com/Directory:Jon_Awbrey
oeiswiki: http://www.oeis.org/wiki/User:Jon_Awbrey
facebook page: https://www.facebook.com/JonnyCache