THIS ALGORITHM RESOLVES THE NP-COMPLETE SUM SUBSET PROBLEM IN POLYNOMIAL TIME 0 - pip3 install mpmath 1 - You can play with the parameters 2 - Modify the depth on precision 3 - Be careful not to exceed the limits of your machine. 4 - Read my work https://www.academia.edu/9371766/DESIGN_A_FUNCTION_OF_THE_H_FAMILY_THAT_SOLVES_THE_NP-COMPLETE_SUM_SUBSET_PROBLEM_IN_O_n_ 5 - This code is tested on Python3 6 - Remember that there are more efficient algorithms to compute elementary functions, such as exponentiation, this is an excellent resource. http://www.amazon.com/Elementary-Functions-Implementation-Jean-Michel-Muller/dp/0817643729 The MIT License Copyright (c) 2010-2014 Oscar Riveros, https://independent.academia.edu/oarr Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
Monday, December 8, 2014
The Code: https://github.com/maxtuno/SSP-Riveros
Friday, December 5, 2014
Tuesday, December 2, 2014
soon publishes an article on an optimization of the use of space, traveling by segments, arbitrary and well ordered size.
Tuesday, November 18, 2014
Monday, November 17, 2014
The columns of the matrix are the integers in binary form, but you can generate this matrix recursively in O(n), the real complexity it’s the matrix multiplication.