Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,209,278 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Degree of a polynomial
Discriminant
Polynomial
Symmetric polynomial
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Which XML Schemas are Streaming Bounded Repairable?
P. Bourhis
,
Gabriele Puppis
,
Cristian Riveros
Theory of Computing Systems
2015
Corpus ID: 18103980
In this paper we consider the problem of repairing, that is, restoring validity of, documents with respect to XML schemas. We…
Expand
2014
2014
Hierarchies Against Sublinear Advice
L. Fortnow
,
R. Santhanam
Electron. Colloquium Comput. Complex.
2014
Corpus ID: 34270499
We strengthen the non-deterministic time hierarchy theorem of [5,15,18] to show that the lower bound holds against sublinear…
Expand
2009
2009
q,t-Catalan Numbers and Generators for the Radical Ideal defining the Diagonal Locus of (C2)n
Kyungyong Lee
,
Li Li
Electronic Journal of Combinatorics
2009
Corpus ID: 7867083
Let $I$ be the ideal generated by alternating polynomials in two sets of $n$ variables. Haiman proved that the $q,t$-Catalan…
Expand
2007
2007
Remarks on a proof-theoretic characterization of polynomial space functions
Giacomo Calamai
2007
Corpus ID: 124954905
We characterize the polynomial space operations as those which are provably total in a flrst order ramifled system which…
Expand
1998
1998
Unambiguous Computations and Locally Deenable Acceptance Types: Expanded Version
R. Niedermeier
,
P. Rossmanith
1998
Corpus ID: 12715910
Hertrampf's locally de nable acceptance types show that many complexity classes can be de ned in terms of polynomial time bounded…
Expand
1983
1983
Complexity Classes of Alternating Machines with Oracles
P. Orponen
International Colloquium on Automata, Languages…
1983
Corpus ID: 206850583
Relativized complexity theory based on alternating Turing machines is considered. Alternating complexity classes are shown to…
Expand
1976
1976
Alternation
Ashok-Kumar Chandra
,
Larry J. Stockmeyer
17th Annual Symposium on Foundations of Computer…
1976
Corpus ID: 263886452
We define alternating Turing Machines which are like nondeterministic Turing Machines, except that existential and universal…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE