document: Proof that the election problem belongs to NF-completeness problems in asynchronous distributed systems This paper is about the hardness of the election problem in asynchronous distributed systems in which processes can crash but links are reliable . The hardness of the problem is defined with respect to the difficulty to solve it despite failures . It is shown that problems encountered in the system are classified as three classes of problems : F -LRB- fault-tolerant -RRB- , NF -LRB- Not fault-tolerant -RRB- and NFC -LRB- NF-completeness -RRB- . Among those , the class NFC are the hardest problems to solve . In this paper , we prove that the Election problem is the most difficult problem which belongs to the class NFC
doc_bio_tags: O O O B I O O O O O B I I O O O O O O O O B I O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O
extractive_keyphrases: election problem asynchronous distributed systems
abstractive_keyphrases: nf-completeness problems distributed computing leader election failure detectors fault-tolerant problems not-fault-tolerant problems