The following pages link to Ang Sheng Li (Q1862887):
Displayed 50 items.
- (Q372960) (redirect page) (← links)
- Unbalanced graph partitioning (Q372961) (← links)
- Kolmogorov complexity and computably enumerable sets (Q490655) (← links)
- Algorithmic aspects of homophyly of networks (Q501003) (← links)
- Separating NE from some nonuniform nondeterministic complexity classes (Q652627) (← links)
- A result about pseudo jump operators (Q687930) (← links)
- Characterizations of locally testable linear- and affine-invariant families (Q764306) (← links)
- Plus cupping degrees do not form an ideal (Q866112) (← links)
- On Lachlan's major sub-degree problem (Q943340) (← links)
- Continuity of capping in \(\mathcal C_{\text{bT}}\) (Q947265) (← links)
- Elementary differences among jump classes (Q1007245) (← links)
- The extendibility of relatively capping degrees under the weak truth table reducibility (Q1334032) (← links)
- On the distribution of Lachlan nonsplitting bases (Q1407550) (← links)
- Complementing cappable degrees in the difference hierarchy. (Q1428038) (← links)
- On a conjecture of Lempp (Q1570019) (← links)
- Bounding cappable degrees (Q1576591) (← links)
- A hierarchy for cuppable degrees (Q1584492) (← links)
- Improved approximation algorithms for the maximum happy vertices and edges problems (Q1750352) (← links)
- Equilibrium games in networks (Q1783214) (← links)
- Non-uniformity and generalised Sacks splitting (Q1862888) (← links)
- A decomposition theorem of \(\text \textbf{0}^ \prime\) (Q2368116) (← links)
- There exists a maximal 3-c.e. enumeration degree (Q2382237) (← links)
- Bounding computably enumerable degrees in the Ershov hierarchy (Q2498901) (← links)
- Splitting and cone avoidance in the d.c.e. degrees (Q2503830) (← links)
- The existence of high nonbounding degrees in the difference hierarchy (Q2576939) (← links)
- Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure (Q2872130) (← links)
- The small-community phenomenon in networks (Q2888854) (← links)
- Community Structures in Classical Network Models (Q2909119) (← links)
- Testing Small Set Expansion in General Graphs (Q2955028) (← links)
- Structural Information and Dynamical Complexity of Networks (Q2976783) (← links)
- The Complexity and Approximability of Minimum Contamination Problems (Q3010410) (← links)
- Unbalanced Graph Partitioning (Q3060735) (← links)
- Characterizations of Locally Testable Linear- and Affine-Invariant Families (Q3087972) (← links)
- Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems (Q3196381) (← links)
- Restricted jump interpolation in the d.c.e. degrees (Q3422022) (← links)
- Derandomizing Graph Tests for Homomorphism (Q3502637) (← links)
- Definable Filters in the Structure of Bounded Turing Reductions (Q3502638) (← links)
- Principal filters definable by parameters in 𝓔<sub>bT</sub> (Q3616223) (← links)
- (Q4030575) (← links)
- Bounding minimal degrees by computably enumerable degrees (Q4254684) (← links)
- (Q4272373) (← links)
- Splitting and nonsplitting, II: A low<sub>2</sub> c.e. degree above which <i>0</i>′ is not splittable (Q4451726) (← links)
- A minimal pair joining to a plus cupping Turing degree (Q4452449) (← links)
- (Q4460841) (← links)
- Turing Definability in the Ershov Hierarchy (Q4466450) (← links)
- Cupping the Recursively Enumerable Degrees by D.R.E. Degrees (Q4487561) (← links)
- (Q4511553) (← links)
- A hierarchy for the plus cupping Turing degrees (Q4650266) (← links)
- Splitting and jump inversion in the Turing degrees (Q4683147) (← links)
- Pointed computations and Martin-Löf randomness (Q4683150) (← links)