This HTML5 document contains 37 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n11https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Patrizia_Gianni
dbo:wikiPageWikiLink
dbr:FGLM_algorithm
Subject Item
dbr:Gröbner_basis
dbo:wikiPageWikiLink
dbr:FGLM_algorithm
Subject Item
dbr:Jean-Charles_Faugère
dbo:wikiPageWikiLink
dbr:FGLM_algorithm
Subject Item
dbr:FGLM_algorithm
rdfs:label
FGLM algorithm
rdfs:comment
FGLM is one of the main algorithms in computer algebra, named after its designers, Faugère, Gianni, Lazard and Mora. They introduced their algorithm in 1993. The input of the algorithm is a Gröbner basis of a zero-dimensional ideal in the ring of polynomials over a field with respect to a monomial order and a second monomial order. As its output, it returns a Gröbner basis of the ideal with respect to the second ordering. The algorithm is a fundamental tool in computer algebra and has been implemented in most of the computer algebra systems. The complexity of FGLM is O(nD3), where n is the number of variables of the polynomials and D is the degree of the ideal. There are several generalization and various applications for FGLM.
dcterms:subject
dbc:Computer_algebra dbc:Commutative_algebra dbc:Polynomials
dbo:wikiPageID
53596792
dbo:wikiPageRevisionID
1094304801
dbo:wikiPageWikiLink
dbc:Polynomials dbr:Polynomial dbr:Algorithm dbr:Complexity_of_algorithms dbr:Field_(mathematics) dbr:Monomial_order dbr:Symbolic_computation dbr:Teo_Mora dbr:Jean-Charles_Faugère dbc:Commutative_algebra dbr:Ideal_(ring_theory) dbc:Computer_algebra dbr:Computer_algebra_system dbr:Patrizia_Gianni dbr:Gröbner_basis dbr:Daniel_Lazard
owl:sameAs
yago-res:FGLM_algorithm n11:2qREX wikidata:Q30596047
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Algebra-stub
dbo:abstract
FGLM is one of the main algorithms in computer algebra, named after its designers, Faugère, Gianni, Lazard and Mora. They introduced their algorithm in 1993. The input of the algorithm is a Gröbner basis of a zero-dimensional ideal in the ring of polynomials over a field with respect to a monomial order and a second monomial order. As its output, it returns a Gröbner basis of the ideal with respect to the second ordering. The algorithm is a fundamental tool in computer algebra and has been implemented in most of the computer algebra systems. The complexity of FGLM is O(nD3), where n is the number of variables of the polynomials and D is the degree of the ideal. There are several generalization and various applications for FGLM.
prov:wasDerivedFrom
wikipedia-en:FGLM_algorithm?oldid=1094304801&ns=0
dbo:wikiPageLength
3046
foaf:isPrimaryTopicOf
wikipedia-en:FGLM_algorithm
Subject Item
dbr:Teo_Mora
dbo:wikiPageWikiLink
dbr:FGLM_algorithm
Subject Item
wikipedia-en:FGLM_algorithm
foaf:primaryTopic
dbr:FGLM_algorithm