Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	SIAM journal on computing 2016-01, Vol.45 (4), p.1433-1447
Hauptverfasser:	Bi, Jingguo, Cheng, Qi, Rojas, J. Maurice
Format:	Artikel
Sprache:	eng
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	1447
container_issue	4
container_start_page	1433
container_title	SIAM journal on computing
container_volume	45
creator	Bi, Jingguo Cheng, Qi Rojas, J. Maurice
description
doi_str_mv	10.1137/140990401
format	Article
fullrecord	<record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_1137_140990401</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_1137_140990401</sourcerecordid><originalsourceid>FETCH-LOGICAL-c264t-23e4adc3373227bcec56423ca0820ffc5f6d0fecbaa48d72ba26741a32438d4f3</originalsourceid><addsrcrecordid>eNo9kEFLwzAYQIMoOKcH_0GuHqrfl6RNe5TpnDBUNj15KGnyBSpdM5JM2b93onh6hwfv8Bi7RLhGlPoGFTQNKMAjNkFoykIj4jGbADS6KGWjT9lZSh8AqBTKCXtf77qhH8lEvgoh8zvKZHMfRm5Gx5_oiy9MdCOlxFeUdkNO3IfI11sTE_GXMOzHsOnNkHj4pMjn_dhnOoAGl87ZiT8YuvjjlL3N719ni2L5_PA4u10WVlQqF0KSMs5KqaUQurNky0oJaQ3UAry3pa8ceLKdMap2WnRGVFqhkULJ2ikvp-zqt2tjSCmSb7ex35i4bxHanyvt_xX5DeAwVO0</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields</title><source>SIAM Journals Online</source><creator>Bi, Jingguo ; Cheng, Qi ; Rojas, J. Maurice</creator><creatorcontrib>Bi, Jingguo ; Cheng, Qi ; Rojas, J. Maurice</creatorcontrib><identifier>ISSN: 0097-5397</identifier><identifier>EISSN: 1095-7111</identifier><identifier>DOI: 10.1137/140990401</identifier><language>eng</language><ispartof>SIAM journal on computing, 2016-01, Vol.45 (4), p.1433-1447</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c264t-23e4adc3373227bcec56423ca0820ffc5f6d0fecbaa48d72ba26741a32438d4f3</citedby><cites>FETCH-LOGICAL-c264t-23e4adc3373227bcec56423ca0820ffc5f6d0fecbaa48d72ba26741a32438d4f3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,3171,27901,27902</link.rule.ids></links><search><creatorcontrib>Bi, Jingguo</creatorcontrib><creatorcontrib>Cheng, Qi</creatorcontrib><creatorcontrib>Rojas, J. Maurice</creatorcontrib><title>Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields</title><title>SIAM journal on computing</title><issn>0097-5397</issn><issn>1095-7111</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><recordid>eNo9kEFLwzAYQIMoOKcH_0GuHqrfl6RNe5TpnDBUNj15KGnyBSpdM5JM2b93onh6hwfv8Bi7RLhGlPoGFTQNKMAjNkFoykIj4jGbADS6KGWjT9lZSh8AqBTKCXtf77qhH8lEvgoh8zvKZHMfRm5Gx5_oiy9MdCOlxFeUdkNO3IfI11sTE_GXMOzHsOnNkHj4pMjn_dhnOoAGl87ZiT8YuvjjlL3N719ni2L5_PA4u10WVlQqF0KSMs5KqaUQurNky0oJaQ3UAry3pa8ceLKdMap2WnRGVFqhkULJ2ikvp-zqt2tjSCmSb7ex35i4bxHanyvt_xX5DeAwVO0</recordid><startdate>201601</startdate><enddate>201601</enddate><creator>Bi, Jingguo</creator><creator>Cheng, Qi</creator><creator>Rojas, J. Maurice</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>201601</creationdate><title>Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields</title><author>Bi, Jingguo ; Cheng, Qi ; Rojas, J. Maurice</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c264t-23e4adc3373227bcec56423ca0820ffc5f6d0fecbaa48d72ba26741a32438d4f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bi, Jingguo</creatorcontrib><creatorcontrib>Cheng, Qi</creatorcontrib><creatorcontrib>Rojas, J. Maurice</creatorcontrib><collection>CrossRef</collection><jtitle>SIAM journal on computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bi, Jingguo</au><au>Cheng, Qi</au><au>Rojas, J. Maurice</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields</atitle><jtitle>SIAM journal on computing</jtitle><date>2016-01</date><risdate>2016</risdate><volume>45</volume><issue>4</issue><spage>1433</spage><epage>1447</epage><pages>1433-1447</pages><issn>0097-5397</issn><eissn>1095-7111</eissn><doi>10.1137/140990401</doi><tpages>15</tpages><oa>free_for_read</oa></addata></record>
fulltext	fulltext
identifier	ISSN: 0097-5397
ispartof	SIAM journal on computing, 2016-01, Vol.45 (4), p.1433-1447
issn	0097-5397 1095-7111
language	eng
recordid	cdi_crossref_primary_10_1137_140990401
source	SIAM Journals Online
title	Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T16%3A47%3A56IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Sublinear%20Root%20Detection%20and%20New%20Hardness%20Results%20for%20Sparse%20Polynomials%20over%20Finite%20Fields&rft.jtitle=SIAM%20journal%20on%20computing&rft.au=Bi,%20Jingguo&rft.date=2016-01&rft.volume=45&rft.issue=4&rft.spage=1433&rft.epage=1447&rft.pages=1433-1447&rft.issn=0097-5397&rft.eissn=1095-7111&rft_id=info:doi/10.1137/140990401&rft_dat=%3Ccrossref%3E10_1137_140990401%3C/crossref%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true