#### Filter Results:

#### Publication Year

2007

2013

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

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) includes… (More)

In a recent paper, Amini et al. introduced a general framework to prove duality theorems between tree decompositions and their dual combinatorial object. They unify all known ad-hoc proofs in one duality theorem based on submodular partition functions. This general theorem remains however a bit technical and relies on this particular submodularity property.… (More)

This article presents an infinite family of combinatorial problems that shows abrupt changes of complexity between neighbour problems. We define problem P l k as a purely constraint-driven variant of hy-pergraph partitioning with parameters k and l as follows: Given a hy-pergraph on n vertices and k sizes of colours t1,. .. , t k of sum n, can we colour the… (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) includes… (More)

- Laurent Lyaudet
- 2007

- ‹
- 1
- ›