Learn More
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and NP. They are defined using non-uniform sequences of arithmetic circuits and provides a framework to study the complexity for sequences of polynomials. Prominent examples of(More)
Some 25 years ago Valiant introduced an algebraic model of computation in order to study the complexity of evaluating families of polynomials. The theory was introduced along with the complexity classes VP and VNP which are analogues of the classical classes P and NP. Families of polynomials that are difficult to evaluate (that is, VNP-complete) include the(More)
Preface This status report outlines my research in the first 2 years of my Ph.D. studies. It also serves as my master's thesis in computer science. Most of the results in this report have already been published in journals or as preprints at IMADA. In this report more background material will be given and the proofs will be more detailed than in the(More)
  • 1