![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 2 | Andy King, Kish Shen, Florence Benoy: Lower-bound Time-complexity Analysis of Logic Programs. ILPS 1997: 261-275 |
Selection of 1 from 7 records - Florence Benoy has 5 coauthors
Copyright © 2009-12-24 by Michael Ley (ley@uni-trier.de)