%0 Generic %1 elser2002mermin %A Elser, Veit %D 2002 %K 2020 arxiv optimization %T The Mermin fixed point %U http://arxiv.org/abs/nlin/0206025 %X The most efficient known method for solving certain computational problems is to construct an iterated map whose fixed points are by design the problem's solution. Although the origins of this idea go back at least to Newton, the clearest expression of its logical basis is an example due to Mermin. A contemporary application in image recovery demonstrates the power of the method.

@misc{elser2002mermin, abstract = {The most efficient known method for solving certain computational problems is to construct an iterated map whose fixed points are by design the problem's solution. Although the origins of this idea go back at least to Newton, the clearest expression of its logical basis is an example due to Mermin. A contemporary application in image recovery demonstrates the power of the method.}, added-at = {2020-01-12T23:37:23.000+0100}, author = {Elser, Veit}, biburl = {https://www.bibsonomy.org/bibtex/28298be26ef51a5b83e615966865648b5/analyst}, description = {The Mermin fixed point}, interhash = {627ba3e71f148810b1ea222bec89b36a}, intrahash = {8298be26ef51a5b83e615966865648b5}, keywords = {2020 arxiv optimization}, note = {cite arxiv:nlin/0206025Comment: Contribution to Mermin Festschrift; 8 pages, 5 figures}, timestamp = {2020-01-12T23:37:23.000+0100}, title = {The Mermin fixed point}, url = {http://arxiv.org/abs/nlin/0206025}, year = 2002 }