Jin-Yi Cai

Jin-Yi Cai

University of Wisconsin-Madison

H-index: 49

North America-United States

About Jin-Yi Cai

Jin-Yi Cai, With an exceptional h-index of 49 and a recent h-index of 22 (since 2020), a distinguished researcher at University of Wisconsin-Madison,

His recent articles reflect a diverse array of research interests and contributions to the field:

Counting Cycles on Planar Graphs in Subexponential Time

Bounded Degree Nonnegative Counting CSP

Shor's Algorithm Does Not Factor Large Integers in the Presence of Noise

A dichotomy for bounded degree graph homomorphisms with nonnegative weights

Restricted Holant Dichotomy on Domains 3 and 4

The complexity of counting planar graph homomorphisms of domain size 3

A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory

Bipartite 3-regular counting problems with mixed signs

Jin-Yi Cai Information

University

Position

___

Citations(all)

8309

Citations(since 2020)

1934

Cited By

6789

hIndex(all)

49

hIndex(since 2020)

22

i10Index(all)

139

i10Index(since 2020)

48

Email

University Profile Page

University of Wisconsin-Madison

Google Scholar

View Google Scholar Profile

Top articles of Jin-Yi Cai

Title

Journal

Author(s)

Publication Date

Counting Cycles on Planar Graphs in Subexponential Time

Algorithmica

Jin-Yi Cai

Ashwin Maran

2024/2

Bounded Degree Nonnegative Counting CSP

ACM Transactions on Computation Theory

Jin-Yi Cai

Daniel P Szabo

2024/3/14

Shor's Algorithm Does Not Factor Large Integers in the Presence of Noise

arXiv preprint arXiv:2306.10072

Jin-Yi Cai

2023/6/15

A dichotomy for bounded degree graph homomorphisms with nonnegative weights

Journal of Computer and System Sciences

Artem Govorov

Jin-Yi Cai

Martin Dyer

2023/3/1

Restricted Holant Dichotomy on Domains 3 and 4

Yin Liu

Austen Z Fan

Jin-Yi Cai

2023/12/9

The complexity of counting planar graph homomorphisms of domain size 3

Jin-Yi Cai

Ashwin Maran

2023/6/2

A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory

computational complexity

Jin-Yi Cai

Zhiguo Fu

Kurt Girstmair

Michael Kowalczyk

2023/6

Bipartite 3-regular counting problems with mixed signs

Journal of Computer and System Sciences

Jin-Yi Cai

Austen Z Fan

Yin Liu

2023/8/1

Holographic Algorithms on Domains of General Size

Theory of Computing Systems

Zhiguo Fu

Jin-Yi Cai

2023/6

Complexity classification of the eight-vertex model

Information and Computation

Jin-Yi Cai

Zhiguo Fu

2023/8/1

Planar 3-way Edge Perfect Matching Leads to A Holant Dichotomy

arXiv preprint arXiv:2303.16705

Jin-Yi Cai

Austen Z Fan

2023/3/29

Properties of position matrices and their elections

Proceedings of the AAAI Conference on Artificial Intelligence

Niclas Boehmer

Jin-Yi Cai

Piotr Faliszewski

Austen Z Fan

Łukasz Janeczko

...

2023/6/26

Planar# CSP Equality Corresponds to Quantum Isomorphism--A Holant Viewpoint

arXiv preprint arXiv:2212.03335

Jin-Yi Cai

Ben Young

2022/12/6

Where Tutte and Holant meet: a view from counting complexity

Jin-Yi Cai

Tyson Williams

2022/7/6

Perfect matchings, rank of connection tensors and graph homomorphisms

Combinatorics, Probability and Computing

Jin-Yi Cai

Artem Govorov

2022/3

FKT is Not Universal—A Planar Holant Dichotomy for Symmetric Constraints

Theory of Computing Systems

Jin-Yi Cai

Zhiguo Fu

Heng Guo

Tyson Williams

2022/2

The complexity of counting edge colorings for simple graphs

Theoretical Computer Science

Jin-Yi Cai

Artem Govorov

2021/10/8

On a Theorem of Lovász that (&sdot, H) Determines the Isomorphism Type of H

ACM Transactions on Computation Theory (TOCT)

Jin-Yi Cai

Artem Govorov

2021/6/4

An FPTAS for the square lattice six-vertex and eight-vertex models at low temperatures

Jin-Yi Cai

Tianyu Liu

2021

New planar P-time computable six-vertex models and a complete complexity classification

Jin-Yi Cai

Zhiguo Fu

Shuai Shao

2021

See List of Professors in Jin-Yi Cai University(University of Wisconsin-Madison)