Boolean circuit complexity of algebraic interpolation problems

This publication has 8 references indexed in Scilit:

• A deterministic algorithm for sparse multivariate polynomial interpolation
  Published by Association for Computing Machinery (ACM) ,1988
• The matching problem for bipartite graphs with polynomially bounded permanents is in NC
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1987
• The complexity of symmetric boolean functions
  Published by Springer Nature ,1987
• Finding irreducible polynomials over finite fields
  Published by Association for Computing Machinery (ACM) ,1986
• A taxonomy of problems with fast parallel algorithms
  Information and Control, 1985
• Factoring sparse multivariate polynomials
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1983
• Probabilistic algorithms in finite fields
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1981
• Factoring polynomials over large finite fields
  Mathematics of Computation, 1970