Notice: On April 23, 2014, Statalist moved from an email list to a forum, based at statalist.org.
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
st: Time complexity of -scobit-
From
Zachary Neal <[email protected]>
To
[email protected]
Subject
st: Time complexity of -scobit-
Date
Tue, 22 Oct 2013 15:11:41 -0400
I am working on an algorithm that involves estimation using -scobit-
and am trying to determine the time complexity of the algorithm. Are
there any estimates of the time complexity of -scobit-, or even of
ordinary -logit-, as a function of N? Given the ML estimation, is
finding the time complexity as a function of N even possible?
Thanks,
Zachary
--
Zachary Neal, PhD
Department of Sociology
Michigan State University
[email protected]
http://www.msu.edu/~zpneal
*
* For searches and help try:
* http://www.stata.com/help.cgi?search
* http://www.stata.com/support/faqs/resources/statalist-faq/
* http://www.ats.ucla.edu/stat/stata/