Posted ICASSP 2013 Presentation

6/16/2013

ICASSP 2013 has accepted our paper

3/6/2013

Brute-Force Search of Fast Convolution Algorithms1

Posted FFT for Fast Convolution Examples

11/30/2012

Wikipedia mentions our research

12/7/2011

JSAT published our paper

12/6/2011

Final paper on this site or JSAT's site.

Posted updated code

8/31/2011

This updated code will now generate SMT-LIB 2.0 QF_BV and QF_LIA benchmarks.

Posted revised paper and updated examples

8/30/2011

Revised preprint.
Updated supporting examples.

Posted code

7/13/2011

We have posted our FFTSearch code.

JSAT accepted our paper

7/11/2011

A revised version of our paper will be posted by mid to late August.

Posted SMT-2011 presentation and code

7/11/2011

We are presenting our research at SMT 2011 and have posted our presentation.

Submitted Paper & Posted Examples

3/28/2011

We submitted our paper to the Journal on Satisfiability, Boolean Modeling and Computation. We also posted supporting examples.
1. Copyright 2013 IEEE. Published in the IEEE 2013 International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2013), scheduled for 26-31 May 2013 in Vancouver, British Columbia, Canada. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works, must be obtained from the IEEE. Contact: Manager, Copyrights and Permissions / IEEE Service Center / 445 Hoes Lane / P.O. Box 1331 / Piscataway, NJ 08855-1331, USA. Telephone: + Intl. 908-562-3966.