You are currently offline. Some features of the site may not work correctly.

# Vieta's formulas

Known as: Viète theorem, Vieta's relations, Viète formulas
In mathematics, Vieta's formulas are formulas that relate the coefficients of a polynomial to sums and products of its roots. Named after François Vi… Expand
Wikipedia

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
• SODA '10
• 2010
• Corpus ID: 113467
The Lovász Local Lemma [5] (LLL) is a powerful result in probability theory that states that the probability that none of a set… Expand
Is this relevant?
2007
2007
• 2007
• Corpus ID: 55719429
We construct a new family, indexed by the odd integers $N\geq 1$, of $(2+1)$-dimensional quantum field theories called {\it… Expand
Is this relevant?
2007
2007
• Log. J. IGPL
• 2007
• Corpus ID: 606835
We investigate some logics which use the concept of minimal models in their definition. Minimal objects are widely used in Logic… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Through their use of weblogs, teenage girls are bridging their offline and online relationships. As the girls use this medium to… Expand
Is this relevant?
2003
2003
• 44th Annual IEEE Symposium on Foundations of…
• 2003
• Corpus ID: 1531045
We consider a model of learning Boolean functions from examples generated by a uniform random walk on {0, 1}/sup n/. We give a… Expand
Is this relevant?
2001
2001
Firstly, in this paper, we prove that the equivalence of simplicity and the symmetry of forking. Secondly, we attempt to recover… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
• CAV
• 1997
• Corpus ID: 9336000
Prepositional logic formulas containing implications can suffer from antecedent failure, in which the formula is true trivially… Expand
Is this relevant?
1996
1996
• 1996
• Corpus ID: 119144757
We present formulas of Rodrigues type giving the Macdonald polynomials for arbitrary partitionsλthrough the repeated application… Expand
Is this relevant?
Highly Cited
1995
Highly Cited
1995
• J. Comput. Syst. Sci.
• 1995
• Corpus ID: 14789766
We study two important extensions of first-order logic (FO) with iteration, the fixpoint and while queries. The main result of… Expand
Is this relevant?
1993
1993
• Ann. Pure Appl. Log.
• 1993
• Corpus ID: 22169649
Abstract Recent studies in semantics of modal and superintuitionistic predicate logics provided many examples of incompleteness… Expand
Is this relevant?