{"id":"https://openalex.org/W7104550492","doi":"https://doi.org/10.1145/3747199.3747555","title":"Faster search for tensor decomposition over finite fields","display_name":"Faster search for tensor decomposition over finite fields","publication_year":2025,"publication_date":"2025-07-28","ids":{"openalex":"https://openalex.org/W7104550492","doi":"https://doi.org/10.1145/3747199.3747555"},"language":null,"primary_location":{"id":"doi:10.1145/3747199.3747555","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3747199.3747555","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3747199.3747555","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3747199.3747555","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Jason Yang","orcid":"https://orcid.org/0009-0007-6619-7167"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jason Yang","raw_affiliation_strings":["Computer Science, Massachusetts Institute of Technology, Cambridge, MA, MA, USA"],"raw_orcid":"https://orcid.org/0009-0007-6619-7167","affiliations":[{"raw_affiliation_string":"Computer Science, Massachusetts Institute of Technology, Cambridge, MA, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.50688468,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"132","last_page":"139"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.8935999870300293,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.8935999870300293,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.023800000548362732,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.009800000116229057,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tensor","display_name":"Tensor (intrinsic definition)","score":0.618399977684021},{"id":"https://openalex.org/keywords/tensor-decomposition","display_name":"Tensor decomposition","score":0.5843999981880188},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.43639999628067017},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4187999963760376},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.3686999976634979},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.3659999966621399},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.35910001397132874},{"id":"https://openalex.org/keywords/tensor-field","display_name":"Tensor field","score":0.3531999886035919}],"concepts":[{"id":"https://openalex.org/C155281189","wikidata":"https://www.wikidata.org/wiki/Q3518150","display_name":"Tensor (intrinsic definition)","level":2,"score":0.618399977684021},{"id":"https://openalex.org/C2986737658","wikidata":"https://www.wikidata.org/wiki/Q30103009","display_name":"Tensor decomposition","level":3,"score":0.5843999981880188},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5083000063896179},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46459999680519104},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.43639999628067017},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4187999963760376},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.3686999976634979},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.3659999966621399},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.35910001397132874},{"id":"https://openalex.org/C166077713","wikidata":"https://www.wikidata.org/wiki/Q1758924","display_name":"Tensor field","level":3,"score":0.3531999886035919},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.3467000126838684},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3041999936103821},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.29190000891685486},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29159998893737793},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2879999876022339},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.2840999960899353},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.2831000089645386},{"id":"https://openalex.org/C158457486","wikidata":"https://www.wikidata.org/wiki/Q17104301","display_name":"Multidimensional systems","level":2,"score":0.27230000495910645},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.26989999413490295},{"id":"https://openalex.org/C51255310","wikidata":"https://www.wikidata.org/wiki/Q1163016","display_name":"Tensor product","level":2,"score":0.2685000002384186},{"id":"https://openalex.org/C135628077","wikidata":"https://www.wikidata.org/wiki/Q220184","display_name":"Finite element method","level":2,"score":0.26510000228881836},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.25049999356269836}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3747199.3747555","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3747199.3747555","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3747199.3747555","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3747199.3747555","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3747199.3747555","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3747199.3747555","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7104550492.pdf","grobid_xml":"https://content.openalex.org/works/W7104550492.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W1974805505","https://openalex.org/W1982842710","https://openalex.org/W1986272312","https://openalex.org/W2004948173","https://openalex.org/W2019865138","https://openalex.org/W2035476608","https://openalex.org/W2106221905","https://openalex.org/W2133908755","https://openalex.org/W2165928982","https://openalex.org/W2954436830","https://openalex.org/W4302010773","https://openalex.org/W4383213621","https://openalex.org/W4390098266","https://openalex.org/W4400648403","https://openalex.org/W4406141792","https://openalex.org/W4406141849","https://openalex.org/W4406269462"],"related_works":[],"abstract_inverted_index":{"We":[0],"present":[1],"an":[2],"\\(O^*(|\\mathbb":[3,57,85],"{F}|^{\\min":[4],"\\left\\lbrace":[5],"R,\\":[6],"\\sum":[7],"_{d\\ge":[8],"2}":[9],"n_d\\right\\rbrace":[10],"+":[11,59],"(R-n_0)(\\sum":[12],"_{d\\ne":[13],"0}":[14],"n_d)})\\)-time":[15],"algorithm":[16,54],"for":[17],"determining":[18],"whether":[19],"the":[20],"rank":[21],"of":[22],"a":[23,52],"concise":[24],"tensor":[25],"\\(T\\in":[26],"\\mathbb":[27],"{F}^{n_0\\times":[28],"\\dots":[29],"\\times":[30],"n_{D-1}}\\)":[31],"is":[32],"\u2264":[33],"R,":[34],"assuming":[35],"n0":[36],"\u2265":[37,39,45],"\u2026":[38],"nD":[40],"\u2212":[41],"1":[42],"and":[43,75],"R":[44],"n0.":[46],"For":[47],"3-dimensional":[48],"tensors,":[49],"we":[50],"have":[51],"second":[53],"running":[55,83],"in":[56],"{F}|^{n_0+n_2":[58],"(R-n_0+1-r_*)(n_1+n_2)+r_*^2})\\)":[60],"time,":[61],"where":[62],"\\(r_*:=":[63],"\\left":[64],"\\lfloor":[65],"\\frac{R}{n_0}":[66],"\\right":[67],"\\rfloor":[68],"+1\\).":[69],"Both":[70],"algorithms":[71],"use":[72],"polynomial":[73],"space":[74],"improve":[76],"on":[77],"our":[78],"previous":[79],"work,":[80],"which":[81],"achieved":[82],"time":[84],"{F}|^{n_0+(R-n_0)(\\sum":[86],"_d":[87],"n_d)})\\).":[88]},"counts_by_year":[],"updated_date":"2026-03-07T13:37:22.277990","created_date":"2025-11-10T00:00:00"}