![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Article
The relationship between root endophytic microbial of plant species and soil properties in different patches of alpine meadow
Plants do not live alone as single entities but are closely associated with an incredible diversity of bacteria, fungi and other organisms. To explore the advantages of endophytes in controlling ecosystem resp...
-
Article
Connections between graphs and matrix spaces
Given a bipartite graph G, the graphical matrix space \(\cal{S}_{G}\) ...
-
Article
Open AccessAn Urban Road Risk Assessment Framework Based on Convolutional Neural Networks
In contemporary cities, road collapse is one of the most common disasters. This study proposed a framework for assessing the risk of urban road collapse. The framework first established a risk indicator system...
-
Article
Constructive non-commutative rank computation is in deterministic polynomial time
We extend the techniques developed in Ivanyos et al. (Comput Complex 26(3):717–763, 2017) to obtain a deterministic polynomial-time algorithm for computing the non-commutative rank of linear spaces of matrices ov...
-
Article
Characterization and phenanthrene sorption of organic matter fractions isolated from organic and mineral soils
Sorption of phenanthrene (PHE) to humic acid (HA) and humin (HM) fractions isolated from organic and mineral soils was investigated to better understand sorption processes in varying soil types. Samples were c...
-
Article
Tripartite-to-Bipartite Entanglement Transformation by Stochastic Local Operations and Classical Communication and the Structure of Matrix Spaces
We study the problem of transforming a tripartite pure state to a bipartite one using stochastic local operations and classical communication (SLOCC). It is known that the tripartite-to-bipartite SLOCC convert...
-
Article
Sparse multivariate polynomial interpolation on the basis of Schubert polynomials
Schubert polynomials were discovered by A. Lascoux and M. Schützenberger in the study of cohomology rings of flag manifolds in 1980s. These polynomials generalize Schur polynomials and form a linear basis of m...
-
Article
Non-commutative Edmonds’ problem and matrix semi-invariants
In 1967, J. Edmonds introduced the problem of computing the rank over the rational function field of an \({n \times n}\) ...
-
Article
Random arithmetic formulas can be reconstructed efficiently
Informally stated, we present here a randomized algorithm that given black-box access to the polynomial f computed by an unknown/hidden arithmetic formula ϕ reconstructs, on the average, an equivalent or smaller ...
-
Article
On the security of Goldreich’s one-way function
Goldreich (ECCC 2000) suggested a simple construction of a candidate one-way function f : {0, 1} n → {0, 1} m where each bit of output is a fi...