Browse using
OpenLink Faceted Browser
OpenLink Structured Data Editor
LodLive Browser
Formats
RDF:
N-Triples
N3
Turtle
JSON
XML
OData:
Atom
JSON
Microdata:
JSON
HTML
Embedded:
JSON
Turtle
Other:
CSV
JSON-LD
Faceted Browser
Sparql Endpoint
About:
Polynomial greatest common divisor
An Entity of Type:
Thing
,
from Named Graph:
http://dbpedia.org
,
within Data Space:
dbpedia-live.demo.openlinksw.com
Greatest common divisor of polynomials
Property
Value
dbo:
description
greatest common divisor of polynomials
(en)
mayor polinomio divisor de dos polinomios dados
(es)
máximo divisor comum de polinómios
(pt)
dbo:
wikiPageExternalLink
http://perso.univ-rennes1.fr/marie-francoise.roy/bpr-ed2-posted1.html
dbo:
wikiPageWikiLink
dbr
:Univariate
dbr
:Principal_ideal_domain
dbr
:Formal_derivative
dbr
:Recursion
dbr
:Unique_factorization_domain
dbc
:Polynomials
dbr
:Integer
dbr
:Real_number
dbr
:Integral_domain
dbr
:Modular_arithmetic
dbr
:Unit_(ring_theory)
dbr
:Identity_matrix
dbr
:Euclidean_domain
dbr
:Resultant
dbr
:Finite_ring
dbr
:Greatest_common_divisor
dbr
:Sylvester_matrix
dbr
:Algebraic_extension
dbr
:Up_to
dbr
:Finitely_generated_field_extension
dbr
:Computer_algebra
dbr
:Springer_Science+Business_Media
dbr
:Rational_number
dbr
:Monic_polynomial
dbr
:Singular_value_decomposition
dbr
:Factorization
dbr
:Field_(mathematics)
dbr
:Euclidean_algorithm
dbr
:Chinese_remainder_theorem
dbr
:Polynomial
dbr
:Root-finding_algorithm
dbr
:List_of_polynomial_topics
dbr
:Subresultant
dbc
:Computer_algebra
dbr
:Factorization_of_polynomials
dbr
:Finite_field
dbr
:Sturm's_theorem
dbr
:Euclidean_division
dbr
:Polynomial_long_division
dbr
:Bézout's_identity
dbr
:Field_of_fractions
dbr
:Multiplicity_(mathematics)
dbr
:Square-free_polynomial
dbr
:Rational_reconstruction_(mathematics)
dbr
:Polynomial_factorization
dbr
:Total_order
dbr
:Computer_algebra_system
dbr
:Root_of_a_function
dbr
:Multivariate_division_algorithm
dbr
:Sturm_sequence
dbr
:Symbolic_computation
dbr
:Hadamard_inequality
dbr
:Numerically_stable
dbr
:Multiple_root
dbr
:Multivariate_polynomial
dbr
:Floating-point_numbers
dbr
:Coefficients
dbr
:Euclid's_algorithm
dbr
:Square-free_factorization
dbp:
em
1.500000
(xsd:double)
2
(xsd:integer)
dbp:
text
If is the greatest common divisor of two polynomials and , then there are two polynomials and such that and either , or , or
(en)
dbp:
wikiPageUsesTemplate
dbt
:Cite_book
dbt
:Main
dbt
:Pad
dbt
:Reflist
dbt
:Math
dbt
:See_also
dbt
:Cite_conference
dbt
:Polynomials
dbt
:Sup
dbt
:Citation
dbt
:Pre
dbt
:Use_American_English
dbt
:Refend
dbt
:Sfrac
dbt
:Refbegin
dbt
:Mvar
dbt
:Abs
dbt
:Refimprove
dbt
:Vanchor
dbt
:Block_indent
dbt
:Short_description
dct:
subject
dbc
:Polynomials
dbc
:Computer_algebra
gold:
hypernym
dbr
:Polynomial
rdf:
type
owl
:Thing
owl
:Thing
rdfs:
label
Polynomial greatest common divisor
(en)
القاسم المشترك الأكبر لمتعددتي حدود
(ar)
Máximo común divisor polinómico
(es)
rdfs:
seeAlso
dbr
:Primitive_part_and_content
owl:
sameAs
freebase
:Polynomial greatest common divisor
yago-res
:Polynomial greatest common divisor
wikidata
:Polynomial greatest common divisor
dbpedia-es
:Polynomial greatest common divisor
dbpedia-ar
:Polynomial greatest common divisor
dbpedia-global
:Polynomial greatest common divisor
dbr
:Polynomial greatest common divisor
prov:
wasDerivedFrom
wikipedia-en
:Polynomial_greatest_common_divisor?oldid=1292052935&ns=0
foaf:
isPrimaryTopicOf
wikipedia-en
:Polynomial_greatest_common_divisor
is
dbo:
wikiPageDisambiguates
of
dbr
:GCD
is
dbo:
wikiPageRedirects
of
dbr
:Subresultant
dbr
:Greatest_common_divisior_of_two_polynomials
dbr
:Greatest_common_divisor_of_two_polynomials
dbr
:Coprime_polynomials
dbr
:Euclid's_algorithm_for_polynomials
dbr
:Euclidean_algorithm_for_polynomials
dbr
:Euclidean_division_of_polynomials
dbr
:Pseudo-remainder
dbr
:Pseudo-remainder_sequence
is
dbo:
wikiPageWikiLink
of
dbr
:Gröbner_basis
dbr
:Algebra
dbr
:Square-free_integer
dbr
:Modular_arithmetic
dbr
:Primitive_part_and_content
dbr
:Partial_fraction_decomposition
dbr
:Extended_Euclidean_algorithm
dbr
:Resultant
dbr
:Coprime_integers
dbr
:Greatest_common_divisor
dbr
:Sylvester_matrix
dbr
:Padé_approximant
dbr
:Factorization_of_polynomials_over_finite_fields
dbr
:Computer_algebra
dbr
:Residue_number_system
dbr
:Rational_function
dbr
:GCD
dbr
:Factorization
dbr
:AF+BG_theorem
dbr
:Subresultant
dbr
:Quartic_equation
dbr
:Sturm's_theorem
dbr
:Separable_extension
dbr
:Primary_decomposition
dbr
:Berlekamp–Rabin_algorithm
dbr
:Square-free_polynomial
dbr
:Polynomial_ring
dbr
:Gauss's_lemma_(polynomials)
dbr
:Maxima_(software)
dbr
:Computer_algebra_system
dbr
:SMP_(computer_algebra_system)
dbr
:Root-finding_algorithms
dbr
:Sparse_polynomial
dbr
:Real-root_isolation
dbr
:Greatest_common_divisior_of_two_polynomials
dbr
:Greatest_common_divisor_of_two_polynomials
dbr
:Coprime_polynomials
dbr
:Euclid's_algorithm_for_polynomials
dbr
:Euclidean_algorithm_for_polynomials
dbr
:Euclidean_division_of_polynomials
dbr
:Pseudo-remainder
dbr
:Pseudo-remainder_sequence
is
rdfs:
seeAlso
of
dbr
:Extended_Euclidean_algorithm
is
foaf:
primaryTopic
of
wikipedia-en
:Polynomial_greatest_common_divisor
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 4.0 International