|
Search the dblp DataBase
Angsheng Li:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Angsheng Li
The Low Splitting Theorem in the Difference Hierarchy. [Citation Graph (0, 0)][DBLP] CiE, 2005, pp:287-296 [Conf]
- Angsheng Li, Yan Song, Guohua Wu
Universal Cupping Degrees. [Citation Graph (0, 0)][DBLP] TAMC, 2006, pp:721-730 [Conf]
- Angsheng Li, Guohua Wu, Yue Yang
On the Quotient Structure of Computably Enumerable Degrees Modulo the Noncuppable Ideal. [Citation Graph (0, 0)][DBLP] TAMC, 2006, pp:731-736 [Conf]
- Chi Tat Chong, Angsheng Li, Yue Yang
The existence of high nonbounding degrees in the difference hierarchy. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 2006, v:138, n:1-3, pp:31-51 [Journal]
- Rod Downey, Angsheng Li, Guohua Wu
Complementing cappable degrees in the difference hierarchy. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 2004, v:125, n:1-3, pp:101-118 [Journal]
- Angsheng Li, Guohua Wu, Yue Yang
Bounding computably enumerable degrees in the Ershov hierarchy. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 2006, v:141, n:1-2, pp:79-88 [Journal]
- S. Barry Cooper, Angsheng Li
Splitting and Nonsplitting, II: A Low2 C.E. Degree above Which 0' Is Not Splittable. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 2002, v:67, n:4, pp:1391-1430 [Journal]
- Angsheng Li, Yang Dongping
Bounding Minimal Degrees by Computably Enumerable Degrees. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1998, v:63, n:4, pp:1319-1347 [Journal]
- Yong Wang, Angsheng Li
A hierarchy for the plus cupping Turing degrees. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 2003, v:68, n:3, pp:972-988 [Journal]
- Marat M. Arslanov, S. Barry Cooper, Angsheng Li
There is No Low Maximal D.C.E. Degree. [Citation Graph (0, 0)][DBLP] Math. Log. Q., 2000, v:46, n:3, pp:409-416 [Journal]
- Dengfeng Li, Angsheng Li
A minimal pair joining to a plus cupping Turing degree. [Citation Graph (0, 0)][DBLP] Math. Log. Q., 2003, v:49, n:6, pp:553-566 [Journal]
- Marat M. Arslanov, S. Barry Cooper, Angsheng Li
There is no low maximal d. c. e. degree - Corrigendum. [Citation Graph (0, 0)][DBLP] Math. Log. Q., 2004, v:50, n:6, pp:628-636 [Journal]
- Angsheng Li
Elementary Differences Among Jump Hierarchies. [Citation Graph (0, 0)][DBLP] TAMC, 2007, pp:79-88 [Conf]
- S. Barry Cooper, Angsheng Li
Preface: Theory and applications of models of computation. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:384, n:1, pp:1- [Journal]
Separating NE from Some Nonuniform Nondeterministic Complexity Classes. [Citation Graph (, )][DBLP]
A Theory for Valiant's Matchcircuits (Extended Abstract). [Citation Graph (, )][DBLP]
Derandomizing Graph Tests for Homomorphism. [Citation Graph (, )][DBLP]
Definable Filters in the Structure of Bounded Turing Reductions. [Citation Graph (, )][DBLP]
Bounding cappable degrees. [Citation Graph (, )][DBLP]
On a conjecture of Lempp. [Citation Graph (, )][DBLP]
On the distribution of Lachlan nonsplitting bases. [Citation Graph (, )][DBLP]
On Lachlan's major sub-degree problem. [Citation Graph (, )][DBLP]
Continuity of capping in CbT. [Citation Graph (, )][DBLP]
A Theory for Valiant's Matchcircuits (Extended Abstract) [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
|