2
Por hex6c
Por hex6c
The image is a self-portrait depicted using a solution of the Travelling Salesman Problem (TSP). The code has been written in R by Fronkonstin (@aschinchon). The TSP asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to the origin city?" TSP is one of the most studied questions in computer science. It is known to be NP-hard, meaning that it is very unlikely that there exists an efficient solution for it. This is in fact related to the most famous open question in computer science, the P vs NP conjecture. It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute, each of which carries a US $1,000,000 prize for the first correct solution. Wanna try?
SuperRare makes it easy to create, sell, and collect rare digital art. SuperRare's smart contract platform allows artists to release limited-edition digital artwork tracked on the blockchain, making the pieces rare, verified, and collectible. Filter the crypto art world's best selling works by artist name, creation type, and year of birth on OpenSea.
Dirección del contrato0xb932...b9e0
ID del token5236
Estándar de tokenERC-721
CadenaEthereum
Ganancias del creador
TSP
Propiedad de
TokenAngels
visibility
29 visualizaciones- PrecioPrecio en USDCantidadVencimientoDe
- PrecioPrecio en USDCantidadDiferencia de sueloVencimientoDe
keyboard_arrow_down
- Ventas
- Transferencias
Evento
Precio
De
Para
Fecha
TSP
Propiedad de
TokenAngels
2
visibility
29 visualizaciones- PrecioPrecio en USDCantidadVencimientoDe
- PrecioPrecio en USDCantidadDiferencia de sueloVencimientoDe
Por hex6c
Por hex6c
The image is a self-portrait depicted using a solution of the Travelling Salesman Problem (TSP). The code has been written in R by Fronkonstin (@aschinchon). The TSP asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to the origin city?" TSP is one of the most studied questions in computer science. It is known to be NP-hard, meaning that it is very unlikely that there exists an efficient solution for it. This is in fact related to the most famous open question in computer science, the P vs NP conjecture. It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute, each of which carries a US $1,000,000 prize for the first correct solution. Wanna try?
SuperRare makes it easy to create, sell, and collect rare digital art. SuperRare's smart contract platform allows artists to release limited-edition digital artwork tracked on the blockchain, making the pieces rare, verified, and collectible. Filter the crypto art world's best selling works by artist name, creation type, and year of birth on OpenSea.
Dirección del contrato0xb932...b9e0
ID del token5236
Estándar de tokenERC-721
CadenaEthereum
Ganancias del creador
keyboard_arrow_down
- Ventas
- Transferencias
Evento
Precio
De
Para
Fecha
