Amanote Research

Amanote Research

    RegisterSign In

On Semiring Complexity of Schur Polynomials

Computational Complexity - Switzerland
doi 10.1007/s00037-018-0169-3
Full Text
Open PDF
Abstract

Available in full text

Categories
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
Date

June 4, 2018

Authors
Sergey FominDima GrigorievDorian NognengÉric Schost
Publisher

Springer Science and Business Media LLC


Related search

Semiring

BAREKENG: Jurnal Ilmu Matematika dan Terapan
2011English

Cofactors and Eigenvectors of Banded Toeplitz Matrices: Trench Formulas via Skew Schur Polynomials

Operators and Matrices
Number TheoryAnalysisAlgebra
2017English

On Centralizer of Semiprime Inverse Semiring

Discussiones Mathematicae - General Algebra and Applications
Applied MathematicsNumber TheoryAlgebra
2016English

A Combinatorial Proof of a Weyl Type Formula for Hook Schur Polynomials

Journal of Algebraic Combinatorics
CombinatoricsDiscrete MathematicsNumber TheoryAlgebra
2007English

Tackling Fluid Tangles Complexity by Knot Polynomials

2012English

A Note on the Levitzki Radical of a Semiring

Fundamenta Mathematicae
Number TheoryAlgebra
1973English

Derivation in Ternary Semiring

International Journal of Pure and Applied Mathematics
MathematicsApplied Mathematics
2016English

On a Theorem of Schur

International Journal of Mathematics and Mathematical Sciences
Mathematics
2001English

Grasp: Randomised Semiring Parsing

The Prague Bulletin of Mathematical Linguistics
2015English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy