Search Results for "large integer factorization"
Sort By:
Showing 45 open source projects for "large integer factorization"
View related business solutions-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
1
LinearSolve.jl
High-Performance Unified Interface for Linear Solvers in Julia
LinearSolve.jl is a unified interface for the linear solving packages of Julia. It interfaces with other packages of the Julia ecosystem to make it easy to test alternative solver packages and pass small types to control algorithm swapping. It also interfaces with the ModelingToolkit.jl world of symbolic modeling to allow for automatically generating high-performance code. Performance is key: the current methods are made to be highly performant on scalar and statically sized small problems,... -
2
DeepCTR
Package of deep-learning based CTR models
DeepCTR is a Easy-to-use,Modular and Extendible package of deep-learning based CTR models along with lots of core components layers which can be used to easily build custom models. You can use any complex model with model.fit(), and model.predict(). Provide tf.keras.Model like interface for quick experiment. Provide tensorflow estimator interface for large scale data and distributed training. It is compatible with both tf 1.x and tf 2.x. With the great success of deep learning,DNN-based... -
3
JuMP
Modeling language for Mathematical Optimization
JuMP is a modeling language and collection of supporting packages for mathematical optimization in Julia. JuMP makes it easy to formulate and solve a range of problem classes, including linear programs, integer programs, conic programs, semidefinite programs, and constrained nonlinear programs. JuMP is used to solve large-scale inventory routing problems at Renault, schedule trains at Thales Inc., plan power grid expansion at PSR, and route school buses. -
4
numbers-java
Java library for number operations
Java library for number operations currently consisting of PrimeFactors.java, which calculates prime factors for a given integer -
Train ML Models With SQL You Already KnowBuild and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
-
5
NVIDIA cuOpt
GPU accelerated decision optimization
NVIDIA cuOpt is a GPU-accelerated optimization engine designed to solve complex mathematical optimization problems at large scale. It supports a range of optimization models including linear programming (LP), mixed integer linear programming (MILP), quadratic programming (QP), and vehicle routing problems (VRP). Built primarily in C++, cuOpt leverages NVIDIA GPUs to deliver near real-time solutions for optimization tasks involving millions of variables and constraints. ... -
6
gojq
Pure Go implementation of jq
...I understand this might cause problems for some scripts but basically, we should not rely on the order of object keys. Due to this limitation, gojq does not have the keys_unsorted function and --sort-keys (-S) option. gojq supports arbitrary-precision integer calculation while jq does not; jq loses the precision of large integers when calculation is involved. -
7
Brick\Math
Arbitrary-precision arithmetic library for PHP
Brick Math is a PHP library that provides arbitrary-precision arithmetic for integers, rational numbers, and decimal numbers. It is designed to overcome the limitations of PHP’s native number handling, especially for applications dealing with large numbers, financial calculations, or scientific computations. Brick Math complies with standards like IEEE 754 and avoids rounding errors inherent to floating-point arithmetic. -
8
ggml
Tensor library for machine learning
ggml is an open-source tensor library designed for efficient machine learning computation with a focus on running models locally and with minimal dependencies. Written primarily in C and C++, the library provides low-level tensor operations and automatic differentiation that allow developers to implement machine learning algorithms and neural networks efficiently. The project emphasizes portability and performance, enabling machine learning inference across a wide range of hardware... -
9
Catalyst.jl
Chemical reaction network and systems biology interface
Catalyst.jl is a symbolic modeling package for analysis and high-performance simulation of chemical reaction networks. Catalyst defines symbolic ReactionSystems, which can be created programmatically or easily specified using Catalyst's domain-specific language (DSL). Leveraging ModelingToolkit and Symbolics.jl, Catalyst enables large-scale simulations through auto-vectorization and parallelism. Symbolic ReactionSystems can be used to generate ModelingToolkit-based models, allowing the easy... -
Full-stack observability with actually useful AI | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
10
Miller
Miller is like awk, sed, cut, join, and sort for name-indexed data
Miller is like awk, sed, cut, join, and sort for data formats such as CSV, TSV, JSON, JSON Lines, and positionally-indexed. With Miller, you get to use named fields without needing to count positional indices, using familiar formats such as CSV, TSV, JSON, JSON Lines, and positionally-indexed. Then, on the fly, you can add new fields which are functions of existing fields, drop fields, sort, aggregate statistically, pretty-print, and more. Miller operates on key-value-pair data while the... -
11
Optimus id transformation
Id obfuscation based on Knuth's multiplicative hashing method for PHP
With this library, you can transform your internal IDs to obfuscated integers based on Knuth's integer hash. It is similar to Hashids but will generate integers instead of random strings. It is also super fast. If you will be running your code on a 32-bit system or will be working with large prime numbers it is suggested that you install the GMP extension. -
12
Streamline Analyst
AI agent that streamlines the entire process of data analysis
Streamline Analyst is a cutting-edge, open-source application powered by Large Language Models (LLMs) designed to revolutionize data analysis. This Data Analysis Agent effortlessly automates all the tasks such as data cleaning, preprocessing, and even complex operations like identifying target objects, partitioning test sets, and selecting the best-fit models based on your data. With Streamline Analyst, results visualization and evaluation become seamless. -
13
C++ Complex Calculator
C++ complex calculator with arrays, matrices, eigenvectors, functions
This is a command line C++ code which compiles and links using gnu g++. It has scientific notation, scientific functions, complex integration including path integrals, and loops with tests. User defined functions are strings. A variable may simultaneously represent a scalar, an array, and a string. Arrays up to ten dimensions are allowed. Householder reduction is used for determinants, eigenvectors, and QR matrix factorization. Class Matrix and class Polynomial facilitate finding... -
14
miRDeep*
MiRDeep*
Please cite: An, J., Lai, J., Lehman, M.L. and Nelson, C.C. (2013) miRDeep*: an integrated application tool for miRNA identification from RNA sequencing data. Nucleic Acids Res, 41, 727-737. We will create index for you if you tell us your interested species (j.an@qut.edu.au). download command line version "MDS_command_line_Vxx.zip" clicking "Browse All Files" please find miRPlant in sourceforge for plant miRNA prediction. -
15
C++ FFT
C++ radix 2 & 3 multi-dimension complex FFT & graphical test program
This C++ code does radix 2 & 3 multi-dimension (any) complex FFT and its inverse. Array dimensions with sizes that are not 2^m 3^n are automatically zero-padded to the nearest larger size integer of the form 2^m 3^n. The new array has the original data centered, except when a dimension size is increased by an odd number, the zero padding on the left is one less than the zero padding on the right. This FFT code is in is own namespace and is in one source file and one include file. There is... -
16
Annoy
Approximate Nearest Neighbors in C++/Python optimized for memory usage
Annoy (Approximate Nearest Neighbors Oh Yeah) is a C++ library with Python bindings to search for points in space that are close to a given query point. It also creates large read-only file-based data structures that are mmapped into memory so that many processes may share the same data. There are some other libraries to do nearest neighbor search. Annoy is almost as fast as the fastest libraries, (see below), but there is actually another feature that really sets Annoy apart: it has the... -
17
Algorithms Math Models
MATLAB implementations of algorithms
Algorithms_MathModels is a large MATLAB collection of algorithms and solved examples targeted at students and teams preparing for mathematical modeling competitions (national and international contests like MCM/ICM). The repository gathers implementations and case studies across many topics commonly used in contest solutions: optimization (linear, integer, goal and nonlinear programming), heuristic and metaheuristic methods (simulated annealing, genetic algorithms, immune algorithms), neural networks and time-series methods, interpolation and regression, graph theory, cellular automata, grey systems, fuzzy models, partial/ordinary differential equations, and multivariate analysis, among others. ... -
18
Pure C99 Quadratic Sieve 230-bit minute, RSA-100 factored, easily accessible on Windows and Linux. Hello and welcome at sourceforge.net, i'm your student at Université de Franche-Comté, Mon, 11 Jul 2022. This ~2500 lines Pure C factorization software : - is imediately compatible with Microsoft Windows, Linux (no one dependancy) - is a C99 command line factorizer from 0 to 300 bits (330 bits were factored in the lab) - is built so that you can easily use and test the software -...
-
19
NFB integer factorization
No-factor-base (NFB) sub-exponential factorization algorithm
This is an easy-to-understand algorithm of integer factorization with heuristically evaluated complexity L(4/15, 2), which is better than the general number field sieve algorithm with L(1/3, 1.923). NFB searches common factors of the quadratic residues modulo n using GCD. All relations are processed by the Gaussian elimination procedure. Different strategies of searching the relations can be applied, many giving complexity better than L(1/3, 1.923). -
20
yafu
Automated integer factorization
Check yafu on github for the latest code. YAFU (with assistance from other free software) uses the most powerful modern algorithms (and implementations of them) to factor input integers in a completely automated way. The automation within YAFU is state-of-the-art, combining factorization algorithms in an intelligent and adaptive methodology that minimizes the time to find the factors of arbitrary input integers. Most algorithm implementations are multi-threaded, allowing YAFU to fully... -
21
Albedo
A recommender system for discovering GitHub repos
Albedo is an open-source recommender system aimed at helping developers discover GitHub repositories by learning from activity signals. It treats repositories and developers as a graph of interactions and applies large-scale matrix factorization to model affinities, with Apache Spark providing the distributed data processing. The project focuses on implicit feedback—stars, watches, and other engagement metrics—so it can build useful recommendations without explicit ratings. A reproducible setup and Makefile-driven workflow streamline tasks like spinning up services, loading datasets, training models, and generating candidate lists. ... -
22
-
23
SONNET
SONNET (integer) linear optimisation in .NET
SONNET builds on top of the well-known COIN libraries for optimisation (see http://www.coin-or.org). It brings the power of (integer) linear programming projects of COIN to .NET. SONNET is licensed under the terms of the Eclipse Public License (EPL). SONNET consists of two parts: 1) A .NET library that consists of .NET wrapper classes around existing COIN classes such as OsiSolverInterface. 2) A .NET library implemented in C# that adds a powerful (rudimentary) modelling API... -
24
xLearn
High performance, easy-to-use, and scalable machine learning (ML)
xLearn is a high-performance, easy-to-use, and scalable machine learning package that contains linear model (LR), factorization machines (FM), and field-aware factorization machines (FFM), all of which can be used to solve large-scale machine learning problems. xLearn is especially useful for solving machine learning problems on large-scale sparse data. Many real-world datasets deal with high dimensional sparse feature vectors like a recommendation system where the number of categories and users is on the order of millions. ... -
25
GILIB
GILIB Large Integer Arithmetic Library
A large integer arithmetic library written in plain C.
