4 citations · 19 across the 21 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2016
Pointed computations and Martin-Löf randomness
George Barmpalias, Andrew Lewis-Pye, Angsheng Li
Schnorr showed that a real is Martin-Loef random if and only if all of its initial segments are incompressible with respect to prefix-free complexity. Fortnow and independently Nie…
cs.CC2008★ 1 cited
A Theory for Valiant's Matchcircuits (Extended Abstract)
Angsheng Li, Mingji Xia
The computational function of a matchgate is represented by its character matrix. In this article, we show that all nonsingular character matrices are closed under matrix inverse o…