Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

A probabilistic analysis of a new satisfiability algorithm

B. Apolloni, S. Di Gregorio

RAIRO. Inform. théor., 16 3 (1982) 201-223

Published online: 2017-02-01

DOI: https://doi.org/10.1051/ita/1982160302011

This article has been cited by the following article(s):

Complexity of vector optimization problems on graphs

V.A. Emeli[acaron]ev and V.A. Perepeliza
Optimization 22 (6) 906 (1991)
https://doi.org/10.1080/02331939108843732

Average polynomial time complexity of some NP-complete problems

Phan Dinh Dieu, Le Cong Thanh and Le Tuan Hoa
Theoretical Computer Science 46 219 (1986)
https://doi.org/10.1016/0304-3975(86)90031-9