Search Results for "assembly to c"

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 utilize multi- or many-core processors...

CLISP is a portable ANSI Common Lisp implementation and development environment by Bruno Haible. Interpreter, compiler, debugger, CLOS, MOP, FFI, Unicode, sockets, CLX. UI in English, German, French, Spanish, Dutch, Russian, and Danish.

Freemat is an interpreted, matrix-oriented development environment for engineering and scientific applications, similar to the commercial package MATLAB. Freemat provides visualization, image manipulation, and plotting as well as parallel programming.

A simple sieve/prefactor program for the so-called Eisenstein-Mersenne Primes: 3^p +- 3^((p + 1)/2) + 1. See http://oeis.org/A125738, A125739 and [1] for a good introduction. Some easily established properties are: p must be prime; sign is minus for p=+-1 (mod 12), plus otherwise; composites only have factors of form 6kp+1 (integer k). Related probable primes (3^p -+ 3^((p + 1)/2) + 1)/7 are sieved at the same time. See http://oeis.org/A125743, A125744. After sieving, the...

"kdiv" is a generator of routines for optimized division by an integer constant based on the work presented in H.S. Warren's "Hacker's Delight". "kdiv" can be used to emit a generic assembly or C implementation of (signed/unsigned) division.

This utility, lingen, implements evolution of native machine code via linear genetic programming. The assembly level code uses a subset of assembly language which manipulates and performs calculations using the floating point unit (FPU) of the CPU.

gmp library that can be linked with MSVC

mcrypt, and the accompanying libmcrypt, are intended to be replacements for the old Unix crypt, except that they are under the GPL and support an ever-wider range of algorithms and modes.

Iterate function viewer for Windows and Linux. It has built in 14 different iterate {Mandelbrot) functions. Many possibilities for changing parameters, saving as bitmap or small file. windows-32. Linux 32 - 64bit. Low level written in assembler.

libNT is a Number Theory Library which is based on a BigInteger Class. It will contain several algorithms for solving Number Theory Problems. Written in the IDE Code::Blocks

A strong, yet minimalistic Math-oriented Programming Language (MML) providing an easy-to-use console and a command-line script interpreter, targetted towards fast calculations for extremely big numbers, and bundled with a number of math libraries.

Engineering Calculator Suite

Matho is a OS Independant Application and API for mathematical operations, features include curve sketching, calculus, iterative formulae, algebra solver, 2d/3d geometry and mechanical and statistical functionality.

This library is meant for high performance calculations for science or 3D games/rasterizers using SIMD instructions of x86 processors to allow an unparalleled level of optimization. This takes advantage of MMX, 3DNow!, 3DNow!+/MMX+, & SSE/SSE2/SSE3/SSSE3

x86mph is an optimized library with vector, matrix, and vertex helpers (including an own TnL) It also contains memory helpers, and other stuff such as image processing (color inverting, changing bpp) taking advantage of x86's 3DNow!, MMX, and SSE

This is meant to be a powerful, but easy to use math software. It's by the user and for the users.

Floating point library for PIC micro controllers

Centrinia is a modern mathematical modules library. It will also incorporate a Computer Algebra System.

Hosting home-made software which is mathematically proven to be correct. We make use of tools like HOL, PVS, ...

Glucas is a client to make primality test for Mersenne numbers. It is related to GIMPS effort to search the bigest primes ever found. In addition, it can be used as an excellent performance test. Posix thread, OpenMP and SunMP compatible

LiteOS is our attempt to write a free OS for calculators known as "TI-68k". TI naturally stands for Texas Instuments while 68k designs the Motorola 68000, in other words the processor running such calculators.

Algomath is a portable 32bit integer Arithmetic C Library with prime numbers and numbers manipulation algorithms. Optional fast assembly language alternatives (NASM source) for prime numbers time-critical functions are also included for the Intel-x86 rang

The goal is to use distributed computing in the least bandwidth-intensive way to find a large prime number. We will have four parts to the project.

This is a port of the GNU MultiPrecision library of C arbitrary-precision arithmetic routines to IA-64, with a focus on efficient (assembly) IA-64 routines for mul_basecase.c and sqr_basecase.c

Fast-Fourier-Transform-based number theory code to test Mersenne numbers for primality using the Lucas-Lehmer test and the Crandall-Fagin irrational-base discrete weighted transform (IBDWT) algorithm (Math. Computation 62 (205), pp.305-324, January 1994)