[eclipse-clp-users] Computational complexity

From: Sergey Dymchenko <kit1980_at_gmail.com>
Date: Fri, 30 Sep 2011 15:49:16 +0300

Any hints how to estimate computational complexity (like Big-O
notation) of CLP programs? I mean there is no visible cycles, not
clear how pruning reduces complexity (does it really reduce in
asymptotic sense?) etc...

Received on Fri Sep 30 2011 - 12:49:22 CEST

This archive was generated by hypermail 2.2.0 : Thu Feb 02 2012 - 02:31:58 CET