[eclipse-clp-users] Computational complexity

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

Hello!

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...

Sergey.

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

This message: [ Message body ]
Next message: Marco Gavanelli: "Re: [eclipse-clp-users] Computational complexity"
Previous message: Bogdan Tanasa: "[eclipse-clp-users] Help"
Next in thread: Marco Gavanelli: "Re: [eclipse-clp-users] Computational complexity"
Reply: Marco Gavanelli: "Re: [eclipse-clp-users] Computational complexity"
Reply: mskala_at_ansuz.sooke.bc.ca: "Re: [eclipse-clp-users] Computational complexity"

Mail actions: [ respond to this message ] [ mail a new topic ]
Contemporary messages sorted: [ by date ] [ by thread ] [ by subject ] [ by author ] [ by messages with attachments ]

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