The following pages link to Yuli Ye (Q443734):
Displaying 16 items.
- Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages (Q443735) (← links)
- Syntactic complexity of regular ideals (Q722210) (← links)
- On sum coloring and sum multi-coloring for restricted families of graphs (Q764335) (← links)
- Priority algorithms for the subset-sum problem (Q1029701) (← links)
- ON THE COMPLEXITY OF THE EVALUATION OF TRANSIENT EXTENSIONS OF BOOLEAN FUNCTIONS (Q2909178) (← links)
- A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem (Q2915696) (← links)
- Elimination graphs (Q3189055) (← links)
- Priority Algorithms for the Subset-Sum Problem (Q3608874) (← links)
- Elimination Graphs (Q3638080) (← links)
- Max-Sum Diversification, Monotone Submodular Functions, and Dynamic Updates (Q4554931) (← links)
- (Q4964007) (← links)
- Syntactic Complexity of Ideal and Closed Languages (Q5199958) (← links)
- Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages (Q5200084) (← links)
- (Q5389283) (← links)
- COVERING OF TRANSIENT SIMULATION OF FEEDBACK-FREE CIRCUITS BY BINARY ANALYSIS (Q5484912) (← links)
- Weakly Submodular Functions (Q6248496) (← links)
