Eintrag weiter verarbeiten
THE COMPLEXITY OF THE EQUIVALENCE PROBLEM OVER FINITE RINGS
Gespeichert in:
| Zeitschriftentitel: | Glasgow Mathematical Journal |
|---|---|
| Personen und Körperschaften: | |
| In: | Glasgow Mathematical Journal, 54, 2012, 1, S. 193-199 |
| Format: | E-Article |
| Sprache: | Englisch |
| veröffentlicht: |
Cambridge University Press (CUP)
|
| Schlagwörter: |
| author_facet |
HORVÁTH, GÁBOR HORVÁTH, GÁBOR |
|---|---|
| author |
HORVÁTH, GÁBOR |
| spellingShingle |
HORVÁTH, GÁBOR Glasgow Mathematical Journal THE COMPLEXITY OF THE EQUIVALENCE PROBLEM OVER FINITE RINGS General Mathematics |
| author_sort |
horváth, gábor |
| spelling |
HORVÁTH, GÁBOR 0017-0895 1469-509X Cambridge University Press (CUP) General Mathematics http://dx.doi.org/10.1017/s001708951100053x <jats:title>Abstract</jats:title><jats:p>We investigate the complexity of the equivalence problem over a finite ring when the input polynomials are written as sum of monomials. We prove that for a finite ring if the factor by the Jacobson radical can be lifted in the centre, then this problem can be solved in polynomial time. This result provides a step in proving a dichotomy conjecture of Lawrence and Willard (J. Lawrence and R. Willard, The complexity of solving polynomial equations over finite rings (manuscript, 1997)).</jats:p> THE COMPLEXITY OF THE EQUIVALENCE PROBLEM OVER FINITE RINGS Glasgow Mathematical Journal |
| doi_str_mv |
10.1017/s001708951100053x |
| facet_avail |
Online Free |
| format |
ElectronicArticle |
| fullrecord |
blob:ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTAxNy9zMDAxNzA4OTUxMTAwMDUzeA |
| id |
ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTAxNy9zMDAxNzA4OTUxMTAwMDUzeA |
| institution |
DE-15 DE-Pl11 DE-Rs1 DE-105 DE-14 DE-Ch1 DE-L229 DE-D275 DE-Bn3 DE-Brt1 DE-Zwi2 DE-D161 DE-Gla1 DE-Zi4 |
| imprint |
Cambridge University Press (CUP), 2012 |
| imprint_str_mv |
Cambridge University Press (CUP), 2012 |
| issn |
0017-0895 1469-509X |
| issn_str_mv |
0017-0895 1469-509X |
| language |
English |
| mega_collection |
Cambridge University Press (CUP) (CrossRef) |
| match_str |
horvath2012thecomplexityoftheequivalenceproblemoverfiniterings |
| publishDateSort |
2012 |
| publisher |
Cambridge University Press (CUP) |
| recordtype |
ai |
| record_format |
ai |
| series |
Glasgow Mathematical Journal |
| source_id |
49 |
| title |
THE COMPLEXITY OF THE EQUIVALENCE PROBLEM OVER FINITE RINGS |
| title_unstemmed |
THE COMPLEXITY OF THE EQUIVALENCE PROBLEM OVER FINITE RINGS |
| title_full |
THE COMPLEXITY OF THE EQUIVALENCE PROBLEM OVER FINITE RINGS |
| title_fullStr |
THE COMPLEXITY OF THE EQUIVALENCE PROBLEM OVER FINITE RINGS |
| title_full_unstemmed |
THE COMPLEXITY OF THE EQUIVALENCE PROBLEM OVER FINITE RINGS |
| title_short |
THE COMPLEXITY OF THE EQUIVALENCE PROBLEM OVER FINITE RINGS |
| title_sort |
the complexity of the equivalence problem over finite rings |
| topic |
General Mathematics |
| url |
http://dx.doi.org/10.1017/s001708951100053x |
| publishDate |
2012 |
| physical |
193-199 |
| description |
<jats:title>Abstract</jats:title><jats:p>We investigate the complexity of the equivalence problem over a finite ring when the input polynomials are written as sum of monomials. We prove that for a finite ring if the factor by the Jacobson radical can be lifted in the centre, then this problem can be solved in polynomial time. This result provides a step in proving a dichotomy conjecture of Lawrence and Willard (J. Lawrence and R. Willard, The complexity of solving polynomial equations over finite rings (manuscript, 1997)).</jats:p> |
| container_issue |
1 |
| container_start_page |
193 |
| container_title |
Glasgow Mathematical Journal |
| container_volume |
54 |
| format_de105 |
Article, E-Article |
| format_de14 |
Article, E-Article |
| format_de15 |
Article, E-Article |
| format_de520 |
Article, E-Article |
| format_de540 |
Article, E-Article |
| format_dech1 |
Article, E-Article |
| format_ded117 |
Article, E-Article |
| format_degla1 |
E-Article |
| format_del152 |
Buch |
| format_del189 |
Article, E-Article |
| format_dezi4 |
Article |
| format_dezwi2 |
Article, E-Article |
| format_finc |
Article, E-Article |
| format_nrw |
Article, E-Article |
| _version_ |
1792326911573098499 |
| geogr_code |
not assigned |
| last_indexed |
2024-03-01T12:28:16.249Z |
| geogr_code_person |
not assigned |
| openURL |
url_ver=Z39.88-2004&ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fvufind.svn.sourceforge.net%3Agenerator&rft.title=THE+COMPLEXITY+OF+THE+EQUIVALENCE+PROBLEM+OVER+FINITE+RINGS&rft.date=2012-01-01&genre=article&issn=1469-509X&volume=54&issue=1&spage=193&epage=199&pages=193-199&jtitle=Glasgow+Mathematical+Journal&atitle=THE+COMPLEXITY+OF+THE+EQUIVALENCE+PROBLEM+OVER+FINITE+RINGS&aulast=HORV%C3%81TH&aufirst=G%C3%81BOR&rft_id=info%3Adoi%2F10.1017%2Fs001708951100053x&rft.language%5B0%5D=eng |
| SOLR | |
| _version_ | 1792326911573098499 |
| author | HORVÁTH, GÁBOR |
| author_facet | HORVÁTH, GÁBOR, HORVÁTH, GÁBOR |
| author_sort | horváth, gábor |
| container_issue | 1 |
| container_start_page | 193 |
| container_title | Glasgow Mathematical Journal |
| container_volume | 54 |
| description | <jats:title>Abstract</jats:title><jats:p>We investigate the complexity of the equivalence problem over a finite ring when the input polynomials are written as sum of monomials. We prove that for a finite ring if the factor by the Jacobson radical can be lifted in the centre, then this problem can be solved in polynomial time. This result provides a step in proving a dichotomy conjecture of Lawrence and Willard (J. Lawrence and R. Willard, The complexity of solving polynomial equations over finite rings (manuscript, 1997)).</jats:p> |
| doi_str_mv | 10.1017/s001708951100053x |
| facet_avail | Online, Free |
| format | ElectronicArticle |
| format_de105 | Article, E-Article |
| format_de14 | Article, E-Article |
| format_de15 | Article, E-Article |
| format_de520 | Article, E-Article |
| format_de540 | Article, E-Article |
| format_dech1 | Article, E-Article |
| format_ded117 | Article, E-Article |
| format_degla1 | E-Article |
| format_del152 | Buch |
| format_del189 | Article, E-Article |
| format_dezi4 | Article |
| format_dezwi2 | Article, E-Article |
| format_finc | Article, E-Article |
| format_nrw | Article, E-Article |
| geogr_code | not assigned |
| geogr_code_person | not assigned |
| id | ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTAxNy9zMDAxNzA4OTUxMTAwMDUzeA |
| imprint | Cambridge University Press (CUP), 2012 |
| imprint_str_mv | Cambridge University Press (CUP), 2012 |
| institution | DE-15, DE-Pl11, DE-Rs1, DE-105, DE-14, DE-Ch1, DE-L229, DE-D275, DE-Bn3, DE-Brt1, DE-Zwi2, DE-D161, DE-Gla1, DE-Zi4 |
| issn | 0017-0895, 1469-509X |
| issn_str_mv | 0017-0895, 1469-509X |
| language | English |
| last_indexed | 2024-03-01T12:28:16.249Z |
| match_str | horvath2012thecomplexityoftheequivalenceproblemoverfiniterings |
| mega_collection | Cambridge University Press (CUP) (CrossRef) |
| physical | 193-199 |
| publishDate | 2012 |
| publishDateSort | 2012 |
| publisher | Cambridge University Press (CUP) |
| record_format | ai |
| recordtype | ai |
| series | Glasgow Mathematical Journal |
| source_id | 49 |
| spelling | HORVÁTH, GÁBOR 0017-0895 1469-509X Cambridge University Press (CUP) General Mathematics http://dx.doi.org/10.1017/s001708951100053x <jats:title>Abstract</jats:title><jats:p>We investigate the complexity of the equivalence problem over a finite ring when the input polynomials are written as sum of monomials. We prove that for a finite ring if the factor by the Jacobson radical can be lifted in the centre, then this problem can be solved in polynomial time. This result provides a step in proving a dichotomy conjecture of Lawrence and Willard (J. Lawrence and R. Willard, The complexity of solving polynomial equations over finite rings (manuscript, 1997)).</jats:p> THE COMPLEXITY OF THE EQUIVALENCE PROBLEM OVER FINITE RINGS Glasgow Mathematical Journal |
| spellingShingle | HORVÁTH, GÁBOR, Glasgow Mathematical Journal, THE COMPLEXITY OF THE EQUIVALENCE PROBLEM OVER FINITE RINGS, General Mathematics |
| title | THE COMPLEXITY OF THE EQUIVALENCE PROBLEM OVER FINITE RINGS |
| title_full | THE COMPLEXITY OF THE EQUIVALENCE PROBLEM OVER FINITE RINGS |
| title_fullStr | THE COMPLEXITY OF THE EQUIVALENCE PROBLEM OVER FINITE RINGS |
| title_full_unstemmed | THE COMPLEXITY OF THE EQUIVALENCE PROBLEM OVER FINITE RINGS |
| title_short | THE COMPLEXITY OF THE EQUIVALENCE PROBLEM OVER FINITE RINGS |
| title_sort | the complexity of the equivalence problem over finite rings |
| title_unstemmed | THE COMPLEXITY OF THE EQUIVALENCE PROBLEM OVER FINITE RINGS |
| topic | General Mathematics |
| url | http://dx.doi.org/10.1017/s001708951100053x |