Loading...
The system can't perform the operation now. Try again later.
Citations per year
Duplicate citations
The following articles are merged in Scholar. Their
combined citations
are counted only for the first article.
Merged citations
This "Cited by" count includes citations to the following articles in Scholar. The ones marked
*
may be different from the article in the profile.
Add co-authors
Co-authors
Follow
New articles by this author
New citations to this author
New articles related to this author's research
Email address for updates
Done
My profile
My library
Metrics
Alerts
Settings
Sign in
Sign in
Get my own profile
Cited by
All
Since 2019
Citations
34
33
h-index
3
3
i10-index
2
2
0
10
5
2019
2020
2021
2022
2023
2024
1
3
6
10
9
3
Public access
View all
View all
1 article
0 articles
available
not available
Based on funding mandates
Co-authors
Nathan Mull
Graduate Student, University of Chicago
Verified email at uchicago.edu
Follow
Shuo Pang
postdoc at
University of Copenhagen
Verified email at di.ku.dk -
Homepage
complexity
proof complexity
Articles
Cited by
Public access
Co-authors
Title
Sort
Sort by citations
Sort by year
Sort by title
Cited by
Cited by
Year
On CDCL-based proof systems with the ordered decision strategy
N Mull, S Pang, A Razborov
SIAM Journal on Computing 51 (4), 1368-1399
, 2022
14
2022
SOS lower bound for exact planted clique
S Pang
36th Computational Complexity Conference (CCC 2021)
, 2021
11
2021
Large clique is hard on average for resolution
S Pang
Computer Science–Theory and Applications: 16th International Computer …
, 2021
9
2021
Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz
J Conneryd, SF De Rezende, J Nordström, S Pang, K Risse
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 1-11
, 2023
2023
Some Results in Proof Complexity and SAT-Solving
S Pang
The University of Chicago
, 2022
2022
The system can't perform the operation now. Try again later.
Articles 1–5
Show more
Privacy
Terms
Help
About Scholar
Search help