The Complexity of DNF of Parities
Saved in:
| Published in | Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science |
|---|---|
| Format | Conference Proceeding |
| Language | English |
| Online Access | Get full text |
| DOI | 10.1145/2840728.2840734 |
Cover
| BookMark | eNotzrFugzAQgGEPzdAmmbvSByDx2YcxY0SbphJqOqSzdTJnFYkAIkQtbx_RMP3br-9JPDRtw0I8g9wAYLJVFmWq7Oa_Gh_Fy-mHo7w9dzX_VcMYtSF6_dxP-aK-Giq-rMQiUH3h9dyl-N6_nfJDXBzfP_JdEZMydogTj1hiaQ0oqVVmOWPyGUjvrUoNo1eUIIdUGgiBDWUhTAgCCYFL1Hop5P17bToaf6muXddXZ-pHB9JNejfr3azXN9LHPL8 |
|---|---|
| ContentType | Conference Proceeding |
| DBID | ADTOC UNPAY |
| DOI | 10.1145/2840728.2840734 |
| DatabaseName | Unpaywall for CDI: Periodical Content Unpaywall |
| Database_xml | – sequence: 1 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| ExternalDocumentID | 10.1145/2840728.2840734 |
| GroupedDBID | ADTOC UNPAY |
| ID | FETCH-LOGICAL-a268t-5c44d4d861203298e9eac910cc8276e4c2a54ef7061ffe6a9ff2840a101fed433 |
| IEDL.DBID | UNPAY |
| IngestDate | Thu Aug 28 11:19:03 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a268t-5c44d4d861203298e9eac910cc8276e4c2a54ef7061ffe6a9ff2840a101fed433 |
| OpenAccessLink | https://proxy.k.utb.cz/login?url=http://dl.acm.org/ft_gateway.cfm?id=2840734&type=pdf |
| ParticipantIDs | unpaywall_primary_10_1145_2840728_2840734 |
| PublicationTitle | Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science |
| Score | 1.7719004 |
| SourceID | unpaywall |
| SourceType | Open Access Repository |
| Title | The Complexity of DNF of Parities |
| URI | http://dl.acm.org/ft_gateway.cfm?id=2840734&type=pdf |
| UnpaywallVersion | publishedVersion |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFH7odhAvKk50qFQQwUPnTJM0PYo6hmDpwcI8lTR9ubh1Y3TI_Ot96bo58LRTLklIXn58eXn5vgDcRpJLxl18sC9zn6vC-hFi6OfSoiGHQ5iaIfcey2HK30ZitEUKG1M1kzqCT7Ze3zAZO3HxUtpJaULyu1pOaFbYfWhLQSfwFrTTOHn6bJR7Hrl4qLMy1WuKHMLBopzp5bcej7fgY3AE6ZqEs3o18tVbVHnP_PzXZNypZcfQ-SPseckGik5gD8tTuKEp4Ln17jQvq6U3td5LPHBJoue1kGoH0sHrx_PQb35E8DWTqvKF4bzghaJjST9gkcKI9k0CfGMUCyVyw7TgaEMCaWtR6sha1zRN685iwYPgDFrltMRz8DCQIgjdj43WqcozHaAi50wLFkbk5hQXcL8xWTZbKV9kKxazyBrzZk2_uzvkvYRWNV_gFUF5lV83I_cLaYOd_A |
| linkProvider | Unpaywall |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFH7odhAvKk50qFQQwUPnTJM0PYo6hmDpwcI8lTR9ubh1Y3TI_Ot96bo58LRTLklIXn58eXn5vgDcRpJLxl18sC9zn6vC-hFi6OfSoiGHQ5iaIfcey2HK30ZitEUKG1M1kzqCT7Ze3zAZO3HxUtpJaULyu1pOaFbYfWhLQSfwFrTTOHn6bJR7Hrl4qLMy1WuKHMLBopzp5bcej7fgY3AE6ZqEs3o18tVbVHnP_PzXZNypZcfQ-SPseckGik5gD8tTuKEp4Ln17jQvq6U3td5LPHBJoue1kGoH0sHrx_PQb35E8DWTqvKF4bzghaJjST9gkcKI9k0CfGMUCyVyw7TgaEMCaWtR6sha1zRN685iwYPgDFrltMRz8DCQIgjdj43WqcozHaAi50wLFkbk5hQXcL8xWTZbKV9kKxazyBrzZk2_uzvkvYRWNV_gFUF5lV83I_cLaYOd_A |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+2016+ACM+Conference+on+Innovations+in+Theoretical+Computer+Science&rft.atitle=The+Complexity+of+DNF+of+Parities&rft_id=info:doi/10.1145%2F2840728.2840734&rft.externalDocID=10.1145%2F2840728.2840734 |