A Efficient Algorithm For Computing k-Factor

Abstract

This article will prove a theorem for the existence of k-factor for k>1 ,and present an efficient algorithm for computing k-factor for all values of k based on this theorem.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…