With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.
You 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.
Try free now
Stop Cyber Threats with VM-Series Next-Gen Firewall on Azure
Native application identity and user-based security for your Azure cloud
Gain integrated visibility across all traffic in a single pass. Deploy Palo Alto Networks VM-Series to determine application identity and content while automating security policy updates via rich APIs.
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.
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.
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
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.
Transform your applications and workflows into powerful agentic systems at global scale.
Gemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
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/)