Research Output per year

## Fingerprint Dive into the research topics where Jason Ryder Morton is active. These topic labels come from the works of this person. Together they form a unique fingerprint.

Rank Test
Mathematics

Boltzmann Machine
Mathematics

Counting Problems
Mathematics

Pfaffian
Mathematics

Algebraic Geometry
Mathematics

Graphical Models
Mathematics

Geometry of Matrices
Mathematics

Tutte Polynomial
Mathematics

##
Network
Recent external collaboration on country level. Dive into details by clicking on the dots.

## Research Output 2005 2017

1
Citation
(Scopus)

## A complete set of invariants for LU-equivalence of density operators

Turner, J. & Morton, J., May 2 2017, In : Symmetry, Integrability and Geometry: Methods and Applications (SIGMA). 13, 028.Research output: Contribution to journal › Article

Density Operator

Polynomial Invariants

Equivalence

Invariant

Geometric Invariant Theory

## Polynomial-time solvable #CSP problems via algebraic models and Pfaffian circuits

Margulies, S. & Morton, J., May 2016, In : Journal of Symbolic Computation. 74, p. 152-180 29 p.Research output: Contribution to journal › Article

Base Change

Pfaffian

Polynomial time

Polynomials

Tensors

3
Citations
(Scopus)

## Computing the Tutte polynomial of lattice path matroids using determinantal circuits

Morton, J. R. & Turner, J., Sep 20 2015, In : Theoretical Computer Science. 598, p. 150-156 7 p., 10391.Research output: Contribution to journal › Article

Tutte Polynomial

Lattice Paths

Matroid

Polynomials

Networks (circuits)

## Discrete restricted Boltzmann machines

Montúfar, G. & Morton, J., Apr 1 2015, In : Journal of Machine Learning Research. 16, p. 653-672 20 p.Research output: Contribution to journal › Article

Boltzmann Machine

Hidden Variables

Coding Theory

Discrete Variables

Algebraic Methods

4
Citations
(Scopus)

## Generalized counting constraint satisfaction problems with determinantal circuits

Morton, J. & Turner, J., Feb 1 2015, In : Linear Algebra and Its Applications. 466, p. 357-381 25 p.Research output: Contribution to journal › Article

Counting Problems

Constraint satisfaction problems

Constraint Satisfaction Problem

Pfaffian

Networks (circuits)