General Polynomial Time Decomposition Algorithms (Special Topic on the Conference on Learning Theory 2005)
Hans Ulrich Simon and Nikolas List

General Polynomial Time Decomposition Algorithms     (Special Topic on the Conference on Learning Theory 2005).pdf 154.04kB
Type: Paper
Tags:

Metadata:
@article{8:12,author={Nikolas List and Hans Ulrich Simon}, Title={General Polynomial Time Decomposition Algorithms (Special Topic on the Conference on Learning Theory 2005)},journal={Journal of Machine Learning Research},volume={8}, url={http://www.jmlr.org/papers/volume8/list07a/list07a.pdf}}
Citation:
Simon, H. U. & List, N.. (2014). General Polynomial Time Decomposition Algorithms (Special Topic on the Conference on Learning Theory 2005) [Data set]. Academic Torrents. https://academictorrents.com/details/85cad139e5d7933d2a0a9609042d7f65d5234910
10 day statistics (1 downloads)
Average Time 31 mins, 18 secs
Average Speed 0.08kB/s
Best Time 31 mins, 18 secs
Best Speed 0.08kB/s
Worst Time 31 mins, 18 secs
Worst Speed 0.08kB/s

Send Feedback