In: Mathematische Annalen, 2015, vol. 361, no. 1-2, p. 1-50
|
In: BIT Numerical Mathematics, 2015, vol. 55, no. 2, p. 459-485
|
In: Bulletin of Earthquake Engineering, 2015, vol. 13, no. 12, p. 3553-3596
|
In: BIT Numerical Mathematics, 2015, vol. 55, no. 1, p. 33-57
|
In: npj Quantum Materials, 2021, vol. 6, no. 1, p. 12
The interplay of nearly degenerate orders in quantum materials can lead to a myriad of emergent phases. A prominent case is that of the high-Tc cuprates for which the relationship between superconductivity and a short-ranged, incommensurate charge density wave in the CuO2 planes involving the dx2−y2 orbitals (Cu-CDW) is a subject of great current interest. Strong modifications of the...
|
Thèse de doctorat : Università della Svizzera italiana, 2021 ; 2021INFO005.
Many relevant discrete optimization problems are believed to be hard to solve efficiently (i.e. they cannot be solved in polynomial time unless P=NP). An approximation algorithm is one of the ways to tackle these hard optimization problems. These algorithms have polynomial running time and compute a feasible solution whose value is within a proven factor (approximation factor) of the optimal...
|
Thèse de doctorat : Università della Svizzera italiana, 2019 ; 2019INFO013.
There are a lot of natural problems arising in real life that can be modeled as discrete optimization problems. Unfortunately many of them are believed to be hard to solve efficiently (i.e. they cannot be solved in polynomial time unless P=NP). An approximation algorithm is one of the ways to tackle these hard optimization problems. These algorithms have polynomial running time and guarantee a...
|
In: Journal of Nonlinear Science, 2014, vol. 24, no. 5, p. 769-808
|
In: Probability Theory and Related Fields, 2014, vol. 160, no. 1-2, p. 279-314
|
In: Foundations of Computational Mathematics, 2014, vol. 14, no. 4, p. 601-633
|