Skip to search formSkip to main contentSkip to account menu

Alternating polynomial

Known as: Alternating polynomials 
In algebra, an alternating polynomial is a polynomial such that if one switches any two of the variables, the polynomial changes sign: Equivalently… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
In this paper we consider the problem of repairing, that is, restoring validity of, documents with respect to XML schemas. We… 
2014
2014
We strengthen the non-deterministic time hierarchy theorem of [5,15,18] to show that the lower bound holds against sublinear… 
2009
2009
Let $I$ be the ideal generated by alternating polynomials in two sets of $n$ variables. Haiman proved that the $q,t$-Catalan… 
2007
2007
We characterize the polynomial space operations as those which are provably total in a flrst order ramifled system which… 
1998
1998
Hertrampf's locally de nable acceptance types show that many complexity classes can be de ned in terms of polynomial time bounded… 
1983
1983
Relativized complexity theory based on alternating Turing machines is considered. Alternating complexity classes are shown to… 
1976
1976
We define alternating Turing Machines which are like nondeterministic Turing Machines, except that existential and universal…