Complex polynomials and circuit lower bounds for modular counting
Gespeichert in:
| Veröffentlicht in: | Computational complexity 1994-12, Vol.4 (4), p.325-338 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 338 |
|---|---|
| container_issue | 4 |
| container_start_page | 325 |
| container_title | Computational complexity |
| container_volume | 4 |
| creator | Barrington, David A. Mix Straubing, Howard |
| description | |
| doi_str_mv | 10.1007/BF01263421 |
| format | Article |
| fullrecord | <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_1007_BF01263421</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_1007_BF01263421</sourcerecordid><originalsourceid>FETCH-LOGICAL-c363t-dd9f622e717efa60069c804c6f558dd3857b1c47c4b812bcb6ba72c005beeef3</originalsourceid><addsrcrecordid>eNpFj0tLxDAYRYMoOI5u_AVZC9Uv73Q5FkeFATezL3lKpW1K0qLz760ouLqXC-fCQeiWwD0BUA-PeyBUMk7JGdoQTqHSteDnawciK8aovkRXpXwAEKEZ36Bdk4apD194Sv1pTENn-oLN6LHrslu6GffpM2Rs0zL6gmPKeEh-6U3Gbp3mbny_RhdxhcLNX27Rcf90bF6qw9vza7M7VI5JNlfe11FSGhRRIRoJIGungTsZhdDeMy2UJY4rx60m1DorrVHUAQgbQohsi-5-b11OpeQQ2yl3g8mnlkD7497-u7NvQyVMsQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Complex polynomials and circuit lower bounds for modular counting</title><source>SpringerLink Journals - AutoHoldings</source><creator>Barrington, David A. Mix ; Straubing, Howard</creator><creatorcontrib>Barrington, David A. Mix ; Straubing, Howard</creatorcontrib><identifier>ISSN: 1016-3328</identifier><identifier>EISSN: 1420-8954</identifier><identifier>DOI: 10.1007/BF01263421</identifier><language>eng</language><ispartof>Computational complexity, 1994-12, Vol.4 (4), p.325-338</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c363t-dd9f622e717efa60069c804c6f558dd3857b1c47c4b812bcb6ba72c005beeef3</citedby><cites>FETCH-LOGICAL-c363t-dd9f622e717efa60069c804c6f558dd3857b1c47c4b812bcb6ba72c005beeef3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Barrington, David A. Mix</creatorcontrib><creatorcontrib>Straubing, Howard</creatorcontrib><title>Complex polynomials and circuit lower bounds for modular counting</title><title>Computational complexity</title><issn>1016-3328</issn><issn>1420-8954</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1994</creationdate><recordtype>article</recordtype><recordid>eNpFj0tLxDAYRYMoOI5u_AVZC9Uv73Q5FkeFATezL3lKpW1K0qLz760ouLqXC-fCQeiWwD0BUA-PeyBUMk7JGdoQTqHSteDnawciK8aovkRXpXwAEKEZ36Bdk4apD194Sv1pTENn-oLN6LHrslu6GffpM2Rs0zL6gmPKeEh-6U3Gbp3mbny_RhdxhcLNX27Rcf90bF6qw9vza7M7VI5JNlfe11FSGhRRIRoJIGungTsZhdDeMy2UJY4rx60m1DorrVHUAQgbQohsi-5-b11OpeQQ2yl3g8mnlkD7497-u7NvQyVMsQ</recordid><startdate>199412</startdate><enddate>199412</enddate><creator>Barrington, David A. Mix</creator><creator>Straubing, Howard</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>199412</creationdate><title>Complex polynomials and circuit lower bounds for modular counting</title><author>Barrington, David A. Mix ; Straubing, Howard</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c363t-dd9f622e717efa60069c804c6f558dd3857b1c47c4b812bcb6ba72c005beeef3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1994</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Barrington, David A. Mix</creatorcontrib><creatorcontrib>Straubing, Howard</creatorcontrib><collection>CrossRef</collection><jtitle>Computational complexity</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Barrington, David A. Mix</au><au>Straubing, Howard</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Complex polynomials and circuit lower bounds for modular counting</atitle><jtitle>Computational complexity</jtitle><date>1994-12</date><risdate>1994</risdate><volume>4</volume><issue>4</issue><spage>325</spage><epage>338</epage><pages>325-338</pages><issn>1016-3328</issn><eissn>1420-8954</eissn><doi>10.1007/BF01263421</doi><tpages>14</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1016-3328 |
| ispartof | Computational complexity, 1994-12, Vol.4 (4), p.325-338 |
| issn | 1016-3328 1420-8954 |
| language | eng |
| recordid | cdi_crossref_primary_10_1007_BF01263421 |
| source | SpringerLink Journals - AutoHoldings |
| title | Complex polynomials and circuit lower bounds for modular counting |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-06T23%3A20%3A57IST&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=Complex%20polynomials%20and%20circuit%20lower%20bounds%20for%20modular%20counting&rft.jtitle=Computational%20complexity&rft.au=Barrington,%20David%20A.%20Mix&rft.date=1994-12&rft.volume=4&rft.issue=4&rft.spage=325&rft.epage=338&rft.pages=325-338&rft.issn=1016-3328&rft.eissn=1420-8954&rft_id=info:doi/10.1007/BF01263421&rft_dat=%3Ccrossref%3E10_1007_BF01263421%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 |