Skip to main content

New answers tagged

4 votes

Computer program for counting graph homomorphisms

In the past few months, we have been working towards a SageMath library for exact counting graph homomorphisms, based on the proof of Prop. 1.6 from "Homomorphisms Are a Good Basis for Counting ...
Jing Guo's user avatar
2 votes

On a efficient algorithm for factoring bivariate polynomials modulo composite modulus assuming the solution is unique

We wrote a 2 page preprint on researchgate Abstract: We give efficient probabilistic algorithm for factoring bivariate polynomials modulo composite integers with unknown factorization assuming the ...
joro's user avatar
  • 24.3k

Top 50 recent answers are included