Search Results for "rings"
Sort By:
Showing 5 open source projects for "rings"
View related business solutions-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
1
PolyBoRi is implemented as a C++ library for Polynomials over Boolean Rings, which provides high-level data types for Boolean polynomials. A python-interface yields extensible algorithms for computing Groebner bases over Boolean Rings.
-
2
Many computational problems need arithmetic operations in polynomial finite rings over Z/nZ, where n is an integer (n>1). This library provides efficient operations for applications such as integer factorization and primality testing.
-
3
The project aims to provide the basic functions and algorithms needed for computations in polynomial rings over the ring of integers, including polynomial arithmetic and D-Groebner Bases. It might evolve in some kind of computer algebra system
-
4
GJAL is a collection of generic class definitions in GJ/Generic Java/JSR-014 that outlines algebraic structures such as Monoids, SemiGroups, Groups, Rings, Fields and various Domains.
-
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
5
PerMuVAR was a library for the Computer Algebra System MuPAD (http://www.mupad.de) for computations in invariant rings of permutation groups. It's now part of the algebraic combinatorics package MuPAD-Combinat (http://mupad-combinat.sf.net/)
- Previous
- You're on page 1
- Next
