English Yefim Dinitz Cited by user Vectornaut on 27 Dec 2023 Yefim Dinitz (Ефим Абрамович Диниц, יפים דיניץ) is a Soviet and Israeli computer scientist associated with the Moscow school of polynomial-time algorithms.
French Problème à promesse Cited by user Pyschobbens on 04 Mar 2023 Dans la théorie de la complexité computationnelle, un problème à promesse est une généralisation d'un problème de décision où l'entrée doit appartenir à un sous-ensemble…
English Dinic's algorithm Cited by user Ryankert on 23 Feb 2023 Dinic's algorithm or Dinitz's algorithm is a strongly polynomial algorithm for computing the maximum flow in a flow network, conceived in 1970 by Israeli (formerly Soviet…
English Complexity class Cited by user Jaydavidmartin on 18 Jun 2022 In computational complexity theory, a complexity class is a set of computational problems of related resource-based complexity.