Prati
Shuo Pang
Shuo Pang
Potvrđena adresa e-pošte na di.ku.dk - Početna stranica
Naslov
Citirano
Citirano
Godina
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
132022
SOS lower bound for exact planted clique
S Pang
36th Computational Complexity Conference (CCC 2021), 2021
122021
Large clique is hard on average for resolution
S Pang
Computer Science–Theory and Applications: 16th International Computer …, 2021
92021
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
12023
Some Results in Proof Complexity and SAT-Solving
S Pang
The University of Chicago, 2022
2022
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–5