%0 Journal Article %1 journals/vlsisp/WinogradN96 %A Winograd, Joseph M. %A Nawab, S. Hamid %D 1996 %J VLSI Signal Processing %K dblp %N 2 %P 193-205 %T Probabilistic complexity analysis for a class of approximate DFT algorithms. %U http://dblp.uni-trier.de/db/journals/vlsisp/vlsisp14.html#WinogradN96 %V 14

@article{journals/vlsisp/WinogradN96, added-at = {2008-08-07T00:00:00.000+0200}, author = {Winograd, Joseph M. and Nawab, S. Hamid}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/218a234263c62ed981a4c60baf36c5fa9/dblp}, ee = {http://dx.doi.org/10.1007/BF00925499}, interhash = {1c8906579dc97cbd360ffdadd26a6867}, intrahash = {18a234263c62ed981a4c60baf36c5fa9}, journal = {VLSI Signal Processing}, keywords = {dblp}, number = 2, pages = {193-205}, timestamp = {2016-02-02T09:52:56.000+0100}, title = {Probabilistic complexity analysis for a class of approximate DFT algorithms.}, url = {http://dblp.uni-trier.de/db/journals/vlsisp/vlsisp14.html#WinogradN96}, volume = 14, year = 1996 }