Pengming Wang
Pengming Wang
DeepMind
Verifierad e-postadress på google.com
Titel
Citeras av
Citeras av
År
From approximate factorization to root isolation with application to cylindrical algebraic decomposition
K Mehlhorn, M Sagraloff, P Wang
Journal of Symbolic Computation 66, 34-69, 2015
272015
The pebbling comonad in finite model theory
S Abramsky, A Dawar, P Wang
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-12, 2017
222017
From approximate factorization to root isolation
K Mehlhorn, M Sagraloff, P Wang
Proceedings of the 38th International Symposium on Symbolic and Algebraic …, 2013
182013
Definability of semidefinite programming and Lasserre lower bounds for CSPs
A Dawar, P Wang
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-12, 2017
112017
A definability dichotomy for finite valued CSPs
A Dawar, P Wang
arXiv preprint arXiv:1504.03543, 2015
92015
Descriptive complexity of constraint problems
P Wang
University of Cambridge, 2018
12018
LICS 2015 External Reviewers
A Pieris, B Lellmann, C Faggian, D Turetsky, DP Muino, D Galmiche, ...
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–7