%0 Journal Article %1 journals/acta/KapurNRZ91 %A Kapur, Deepak %A Narendran, Paliath %A Rosenkrantz, Daniel J. %A Zhang, Hantao %D 1991 %J Acta Informatica %K dblp %N 4 %P 311-350 %T Sufficient-Completeness, Ground-Reducibility and their Complexity. %U http://dblp.uni-trier.de/db/journals/acta/acta28.html#KapurNRZ91 %V 28

@article{journals/acta/KapurNRZ91, added-at = {2023-01-17T00:00:00.000+0100}, author = {Kapur, Deepak and Narendran, Paliath and Rosenkrantz, Daniel J. and Zhang, Hantao}, biburl = {https://www.bibsonomy.org/bibtex/2976bb2c96edb6f0a4589d7556aebc88c/dblp}, ee = {https://doi.org/10.1007/BF01893885}, interhash = {4a42fdcda1c64ff311e42658052a407f}, intrahash = {976bb2c96edb6f0a4589d7556aebc88c}, journal = {Acta Informatica}, keywords = {dblp}, number = 4, pages = {311-350}, timestamp = {2024-04-08T16:44:08.000+0200}, title = {Sufficient-Completeness, Ground-Reducibility and their Complexity.}, url = {http://dblp.uni-trier.de/db/journals/acta/acta28.html#KapurNRZ91}, volume = 28, year = 1991 }