ABSTRACT
No abstract available.
- Max Chandler
Recommendations
Min-max and robust polynomial optimization
We consider the robust (or min-max) optimization problem $$J^*:=\max_{\mathbf{y}\in{\Omega}}\min_{\mathbf{x}}\{f(\mathbf{x},\mathbf{y}): (\mathbf{x},\mathbf{y})\in\mathbf{\Delta}\}$$ where f is a polynomial and $${\mathbf{\Delta}\subset\mathbb{R}^n\...
Max Newman: Topologist, Codebreaker, and Pioneer of Computing
The dominant discourse in the History of Computing holds that the world's first stored-program digital electronic computer--the Manchester "Baby"--was developed under the sole leadership and direction of the Department of Electro-Technics. This ...
Limit theorems for random MAX-2-XORSAT
LATIN'10: Proceedings of the 9th Latin American conference on Theoretical InformaticsWe consider random instances of the MAX-2-XORSAT optimization problem. A 2-XOR formula is a conjunction of Boolean equations (or clauses) of the form x⊕y=0 or x⊕y=1. The MAX-2-XORSAT problem asks for the maximum number of clauses which can be satisfied ...
Comments