%0 Journal Article %1 journals/jcss/Feldman09 %A Feldman, Vitaly %D 2009 %J J. Comput. Syst. Sci. %K dblp %N 1 %P 13-26 %T Hardness of approximate two-level logic minimization and PAC learning with membership queries. %U http://dblp.uni-trier.de/db/journals/jcss/jcss75.html#Feldman09 %V 75

@article{journals/jcss/Feldman09, added-at = {2021-02-16T00:00:00.000+0100}, author = {Feldman, Vitaly}, biburl = {https://www.bibsonomy.org/bibtex/2c13a8dd77e855a1a7301f5ea822dd28e/dblp}, ee = {https://doi.org/10.1016/j.jcss.2008.07.007}, interhash = {51cc60ebc39898c619e2fc926e233d7c}, intrahash = {c13a8dd77e855a1a7301f5ea822dd28e}, journal = {J. Comput. Syst. Sci.}, keywords = {dblp}, number = 1, pages = {13-26}, timestamp = {2024-04-08T19:15:40.000+0200}, title = {Hardness of approximate two-level logic minimization and PAC learning with membership queries.}, url = {http://dblp.uni-trier.de/db/journals/jcss/jcss75.html#Feldman09}, volume = 75, year = 2009 }