%0 Conference Paper %1 conf/compsac/RomanikV93 %A Romanik, Kathleen %A Vitter, Jeffrey Scott %B COMPSAC %D 1993 %I IEEE %K dblp %P 367-373 %T Using computational learning theory to analyze the testing complexity of program segments. %U http://dblp.uni-trier.de/db/conf/compsac/compsac1993.html#RomanikV93 %@ 0-8186-4440-0

@inproceedings{conf/compsac/RomanikV93, added-at = {2017-05-21T00:00:00.000+0200}, author = {Romanik, Kathleen and Vitter, Jeffrey Scott}, biburl = {https://www.bibsonomy.org/bibtex/2d1a461e1807d144a0483b29777e62a36/dblp}, booktitle = {COMPSAC}, crossref = {conf/compsac/1993}, ee = {https://doi.org/10.1109/CMPSAC.1993.404242}, interhash = {8ac34b9a78d3ba87860af001a8524575}, intrahash = {d1a461e1807d144a0483b29777e62a36}, isbn = {0-8186-4440-0}, keywords = {dblp}, pages = {367-373}, publisher = {IEEE}, timestamp = {2019-10-17T20:11:13.000+0200}, title = {Using computational learning theory to analyze the testing complexity of program segments.}, url = {http://dblp.uni-trier.de/db/conf/compsac/compsac1993.html#RomanikV93}, year = 1993 }