Buscar
Mostrando ítems 1-10 de 354
Comparison of quadratization methods for integer factorization via adiabatic quantum computing
(Florianópolis, SC., 2022)
Eisenstein snowflakes
(Wolfram Demonstration Project, 2016)
Eisenstein snowflakes
(Wolfram Demonstration Project, 2011)
An integer programming approach for the time-dependent traveling salesman problem with time windows
(Pergamon-Elsevier Science Ltd, 2017-12)
Congestion in large cities and populated areas is one of the major challenges in urban logistics, andshould be addressed at different planning and operational levels. The Time Dependent Travelling Sales-man Problem (TDTSP) ...
Domínios Euclidianos e Inteiros Gaussianos
(Universidade Estadual Paulista (Unesp), 2019-05-02)
A proposta deste trabalho é aprofundar os estudos sobre a estrutura algébrica dos anéis. Neste sentido tratamos dos Domínios de Fatoração Única (UFD), Domínios Euclidianos e do anel dos Inteiros Gaussianos, bem como ...
Incorporating condition measures in the context of combinatorial optimization
(SIAM PUBLICATIONS, 2006)
Integer programming algorithms have some kind of exponential complexity in the worst case. However, it is also observed that data instances of similar sizes might have very different practical complexity when solved by ...
Factoring an integer
(Wolfram demonstrations project, 2016)
Factoring an integer
(Wolfram demonstrations project, 2013)
Algorithms for factoring large integers
(Universidad de los AndesMatemáticasFacultad de CienciasDepartamento de Matemáticas, 2020)
Integer factorization is a problem of great interest considering that it allows us to better understand numbers and compute certain arithmetic functions more easily. Furthermore, safety of the famous RSA cryptosystem is ...
Factoring an Integer
(Wolfram Demonstration Project, 2016)