Pengming Wang

Orcid: 0009-0009-4976-4267

Affiliations:
  • University of Cambridge, Computer Laboratory, UK
  • Max Planck Institute for Informatics (MPII), Saarbrücken, Germany


According to our database1, Pengming Wang authored at least 11 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Mathematical discoveries from program search with large language models.
Nat., January, 2024

2023
Optimizing Memory Mapping Using Deep Reinforcement Learning.
CoRR, 2023

2021
Learning a Large Neighborhood Search Algorithm for Mixed Integer Programs.
CoRR, 2021

2020
Solving Mixed Integer Programs Using Neural Networks.
CoRR, 2020

2018
Descriptive complexity of constraint problems.
PhD thesis, 2018

2017
Definability of semidefinite programming and lasserre lower bounds for CSPs.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

The pebbling comonad in Finite Model Theory.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016
Lasserre Lower Bounds and Definability of Semidefinite Programming.
CoRR, 2016

2015
From approximate factorization to root isolation with application to cylindrical algebraic decomposition.
J. Symb. Comput., 2015

A Definability Dichotomy for Finite Valued CSPs.
Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2013
From approximate factorization to root isolation.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013


  Loading...