| http://dbpedia.org/ontology/abstract
|
In mathematics, polynomial identity testin … In mathematics, polynomial identity testing (PIT) is the problem of efficiently determining whether two multivariate polynomials are identical. More formally, a PIT algorithm is given an arithmetic circuit that computes a polynomial p in a field, and decides whether p is the zero polynomial. Determining the computational complexity required for polynomial identity testing is one of the most important open problems in algebraic computing complexity.roblems in algebraic computing complexity.
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
https://nickhar.wordpress.com/2012/02/01/lecture-9-polynomial-identity-testing-by-the-schwartz-zippel-lemma/ +
, https://researchmatters.in/news/prof-nitin-saxena-iit-kanpur-awarded-shanti-swarup-bhatnagar-prize-2018-his-work-algebraic +
|
| http://dbpedia.org/ontology/wikiPageID
|
20593462
|
| http://dbpedia.org/ontology/wikiPageLength
|
5962
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
870127486
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Time_complexity +
, http://dbpedia.org/resource/Field_%28math%29 +
, http://dbpedia.org/resource/Computational_complexity_theory +
, http://dbpedia.org/resource/GF%282%29 +
, http://dbpedia.org/resource/IP_%28complexity%29 +
, http://dbpedia.org/resource/Randomized_polynomial_time +
, http://dbpedia.org/resource/Category:Polynomials +
, http://dbpedia.org/resource/Polynomial_time +
, http://dbpedia.org/resource/Category:Computer_algebra +
, http://dbpedia.org/resource/Tutte_matrix +
, http://dbpedia.org/resource/PSPACE +
, http://dbpedia.org/resource/Schwartz%E2%80%93Zippel_lemma +
, http://dbpedia.org/resource/AKS_primality_test +
, http://dbpedia.org/resource/Monomial +
, http://dbpedia.org/resource/Degree_of_a_polynomial +
, http://dbpedia.org/resource/Polynomial +
, http://dbpedia.org/resource/Field_%28mathematics%29 +
, http://dbpedia.org/resource/Polynomials +
, http://dbpedia.org/resource/Primality_testing +
, http://dbpedia.org/resource/Arithmetic_circuit +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Youtube +
, http://dbpedia.org/resource/Template:Reflist +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Polynomials +
, http://dbpedia.org/resource/Category:Computer_algebra +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Polynomial_identity_testing?oldid=870127486&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Polynomial_identity_testing +
|
| owl:sameAs |
http://dbpedia.org/resource/Polynomial_identity_testing +
, http://yago-knowledge.org/resource/Polynomial_identity_testing +
, https://global.dbpedia.org/id/2NekQ +
, http://www.wikidata.org/entity/Q25303629 +
|
| rdfs:comment |
In mathematics, polynomial identity testin … In mathematics, polynomial identity testing (PIT) is the problem of efficiently determining whether two multivariate polynomials are identical. More formally, a PIT algorithm is given an arithmetic circuit that computes a polynomial p in a field, and decides whether p is the zero polynomial. Determining the computational complexity required for polynomial identity testing is one of the most important open problems in algebraic computing complexity.roblems in algebraic computing complexity.
|
| rdfs:label |
Polynomial identity testing
|
