F4
Library for Gröebner basis computation in finite field.
 All Classes Namespaces Files Functions Variables Friends Pages
Typedefs | Functions
benchmark-givaro-modular-integer.cpp File Reference
#include <iostream>
#include <f4.h>
Include dependency graph for benchmark-givaro-modular-integer.cpp:

Go to the source code of this file.

Typedefs

typedef Givaro::Modular
< Givaro::Integer > 
Field
 
typedef ElementGivaro< Field > eltType
 

Functions

Givaro::Integer modulo (Givaro::Integer("115792089237316195423570985008687907853269984665640564039457584007913129640233"))
 
Field F (modulo)
 
int cyclic6F4 (bool magma)
 
int cyclic7F4 (bool magma)
 
int cyclic8F4 (bool magma)
 
int cyclic9F4 (bool magma)
 
int katsura9F4 (bool magma)
 
int katsura10F4 (bool magma)
 
int katsura11F4 (bool magma)
 
int katsura12F4 (bool magma)
 
int randomIdealF4 (bool magma)
 
int main (int argc, char **argv)