GitHub - zhaokw/KaratsubaMultiplication: This Java project takes two rows of input as factors for two polynomials, where each row contains a set of factors from x^0 to x^n, separated by spaces. It returns an array of factors for the resulting polynomial product and has a time complexity of O(n^log3(2)) where n denotes the largest power of the product.

zhaokw / KaratsubaMultiplication Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

This Java project takes two rows of input as factors for two polynomials, where each row contains a set of factors from x^0 to x^n, separated by spaces. It returns an array of factors for the resulting polynomial product and has a time complexity of O(n^log3(2)) where n denotes the largest power of the product.