Skip to search formSkip to main content

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

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

In [12], Hillar and Lim famously demonstrated that "multilinear (tensor) analogues of many efficiently computable problems in… Expand

Is this relevant?

2016

2016

We investigate the computational complexity of tensor rank, a concept that plays fundamental role in different topics of modern… Expand

Is this relevant?

2015

2015

We introduce and study equivariant Hilbert series of ideals in polynomial rings in countably many variables that are invariant… Expand

Is this relevant?

2015

2015

Asymptotic normality in the maximum entropy models on graphs with an increasing number of parameters

Maximum entropy models, motivated by applications in neuron science, are natural generalizations of the β -model to weighted… Expand

Is this relevant?

2015

2015

Tuberculosis is a fast growing health problem and health care workers are at the greater risk of acquiring it through their… Expand

Is this relevant?

2013

2013

A uniform hypergraph is properly k-colorable if each vertex is colored by one of k colors and no edge is completely colored by… Expand

Is this relevant?

2009

2009

Exploiting symmetry in Grobner basis computations is difficult when the symmetry takes the form of a group acting by… Expand

Is this relevant?

2009

2009

Let K be a totally real Galois number field. C. J. Hillar proved that if f in Q[x_1,...,x_n] is a sum of m squares in K[x_1… Expand

Is this relevant?

2004

2004

74. M. Thibonnier, M. D, Lardoux, and P. Corvol, Br. J. Clin Pharmacol., 9, 561-567 (1980). 75. K. Tomioka, T. Yamada, and T… Expand

Is this relevant?

1979