Pengming Wang
Pengming Wang
DeepMind
Verified email at google.com
Title
Cited by
Cited by
Year
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
402017
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
402015
Solving mixed integer programs using neural networks
V Nair, S Bartunov, F Gimeno, I von Glehn, P Lichocki, I Lobov, ...
arXiv preprint arXiv:2012.13349, 2020
342020
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
152017
From approximate factorization to root isolation
K Mehlhorn, M Sagraloff, P Wang
Proceedings of the 38th International Symposium on Symbolic and Algebraic …, 2013
132013
A definability dichotomy for finite valued CSPs
A Dawar, P Wang
arXiv preprint arXiv:1504.03543, 2015
82015
Lasserre lower bounds and definability of semidefinite programming
A Dawar, P Wang
arXiv preprint arXiv:1602.05409, 2016
42016
Learning a large neighborhood search algorithm for mixed integer programs
N Sonnerat, P Wang, I Ktena, S Bartunov, V Nair
arXiv preprint arXiv:2107.10201, 2021
32021
Descriptive complexity of constraint problems
P Wang
University of Cambridge, 2018
12018
The system can't perform the operation now. Try again later.
Articles 1–9