0
$\begingroup$

According to Wikipedia, Even, S .; Itai, A .; Shamir, A. cited it in "On the complexity of time table and multi-commodity flow problems".

The paper can be found here: http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-get.cgi/1975/CS/CS0059.pdf

EDIT: Reference [5] of the above paper can be found here: https://www.jstor.org/stable/2310460

Improve this question
$\endgroup$
8
  • $\begingroup$ The paper is 27 pages long. Can you point to the exact location where this is mentioned, or copy the relevant text? $\endgroup$
    – Yuval Filmus
    Commented Apr 12, 2019 at 18:17
  • $\begingroup$ Several algorithms are described on Wikipedia, including one attributed to your paper. $\endgroup$
    – Yuval Filmus
    Commented Apr 12, 2019 at 18:18
  • $\begingroup$ This is mentioned on page 14 $\endgroup$
    – Gregor K
    Commented Apr 12, 2019 at 19:10
  • $\begingroup$ The paper gives the appropriate references on page 14. $\endgroup$
    – Yuval Filmus
    Commented Apr 12, 2019 at 20:05
  • $\begingroup$ Ok, I leave the question standing here and try to understand how an algorithm with quantifiers performs the resolution step in time complexity n square. $\endgroup$
    – Gregor K
    Commented Apr 12, 2019 at 21:01

0

Reset to default

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Browse other questions tagged or ask your own question.