%0 Conference Paper %1 conf/ipps/FengML00 %A Feng, Wenyi %A Meyer, Fred J. %A Lombardi, Fabrizio %B IPDPS Workshops %D 2000 %E Rolim, José D. P. %I Springer %K dblp %P 951-958 %T Complexity Bounds for Lookup Table Implementation of Factored Forms in FPGA Technology Mapping. %U http://dblp.uni-trier.de/db/conf/ipps/ipdpsW2000.html#FengML00 %V 1800 %@ 3-540-67442-X

@inproceedings{conf/ipps/FengML00, added-at = {2017-05-24T00:00:00.000+0200}, author = {Feng, Wenyi and Meyer, Fred J. and Lombardi, Fabrizio}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2c23302eeb783f145193d766c109ba231/dblp}, booktitle = {IPDPS Workshops}, crossref = {conf/ipps/2000w}, editor = {Rolim, José D. P.}, ee = {https://doi.org/10.1007/3-540-45591-4_130}, interhash = {13f0cb52da388d96ff29434f64b124f5}, intrahash = {c23302eeb783f145193d766c109ba231}, isbn = {3-540-67442-X}, keywords = {dblp}, pages = {951-958}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-09-27T15:12:02.000+0200}, title = {Complexity Bounds for Lookup Table Implementation of Factored Forms in FPGA Technology Mapping.}, url = {http://dblp.uni-trier.de/db/conf/ipps/ipdpsW2000.html#FengML00}, volume = 1800, year = 2000 }