%0 Conference Paper %1 conf/cade/GanzingerM01 %A Ganzinger, Harald %A McAllester, David A. %B IJCAR %D 2001 %E Goré, Rajeev %E Leitsch, Alexander %E Nipkow, Tobias %I Springer %K dblp %P 514-528 %T A New Meta-complexity Theorem for Bottom-Up Logic Programs. %U http://dblp.uni-trier.de/db/conf/cade/ijcar2001.html#GanzingerM01 %V 2083 %@ 3-540-42254-4

@inproceedings{conf/cade/GanzingerM01, added-at = {2017-05-21T00:00:00.000+0200}, author = {Ganzinger, Harald and McAllester, David A.}, biburl = {https://www.bibsonomy.org/bibtex/2a958a4a1e7f9e59d960129fdbe39b40e/dblp}, booktitle = {IJCAR}, crossref = {conf/cade/2001}, editor = {Goré, Rajeev and Leitsch, Alexander and Nipkow, Tobias}, ee = {https://doi.org/10.1007/3-540-45744-5_44}, interhash = {4dcdaff481e27b85957008b1fed1ea81}, intrahash = {a958a4a1e7f9e59d960129fdbe39b40e}, isbn = {3-540-42254-4}, keywords = {dblp}, pages = {514-528}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T18:55:20.000+0200}, title = {A New Meta-complexity Theorem for Bottom-Up Logic Programs.}, url = {http://dblp.uni-trier.de/db/conf/cade/ijcar2001.html#GanzingerM01}, volume = 2083, year = 2001 }