Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random
Saved in:
| Published in | Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing |
|---|---|
| Format | Conference Proceeding |
| Language | English |
| Online Access | Get full text |
| DOI | 10.1145/3519935.3519955 |
Cover
| BookMark | eNotj7tOwzAUQD3AAIWZ1T-Q4mcebCXiJVUCCRiYomv7hlhK7Mpxhfr3FJrpLEdHOpfkLMSAhNxwtuZc6VupedNIvf6n1hfkazN-x-TzMM0UgqMWU_a9t5Bxpn1M9D7GESHQ9v2NJuz3GbKP4Y7OU4x5QEf9TEOkAySHiebhqKZjKE5X5LyHccbrhSvy-fjw0T4X29enl3azLUCUdS6U7QG1YE5jqTgil6qWlawYF4aXRqA1EiqGFlBYIWvOGu2UUUY2Sjuj5YqwU3cfdnD4gXHsdslPkA4dZ93fdbdcd8u1_AVrO1In |
|---|---|
| ContentType | Conference Proceeding |
| DBID | ADTOC UNPAY |
| DOI | 10.1145/3519935.3519955 |
| 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/3519935.3519955 |
| GroupedDBID | ADTOC UNPAY |
| ID | FETCH-LOGICAL-a268t-4cfae520d5e641ee13483737012b16b2ecb3a70ecae2c2381095d4b4b3945db53 |
| IEDL.DBID | UNPAY |
| IngestDate | Thu Aug 28 11:29:08 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| License | cc-by |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a268t-4cfae520d5e641ee13483737012b16b2ecb3a70ecae2c2381095d4b4b3945db53 |
| OpenAccessLink | https://proxy.k.utb.cz/login?url=https://dl.acm.org/doi/pdf/10.1145/3519935.3519955 |
| ParticipantIDs | unpaywall_primary_10_1145_3519935_3519955 |
| PublicationTitle | Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing |
| Score | 2.4295506 |
| SourceID | unpaywall |
| SourceType | Open Access Repository |
| Title | Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random |
| URI | https://dl.acm.org/doi/pdf/10.1145/3519935.3519955 |
| UnpaywallVersion | publishedVersion |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFA5zO4gXFScqKjl48dDZNkm3epvDMTyMgQ62U8mPFxX7Y6wton-9SVuniJedcnmE8B7J917yvi8IXSktB6ErwHGJ0g5lwncE1cwZENCeR5Roui2mwWROHxZs0UL-NxdGxWaepHrCt3t6pXQjaMtu7FdyIWG9amRsB3UCZvLvNurMp7PhstHt-cdyD-2W6Yp_vPM4_gUe4_2a0JdXmoO2Z-StVxaiJz__KDJut64D1P0h6-HZBoYOUQvSI7Qcxs-ZqftfkhzzVGFp26d1xXfLsclT8V2WxcBTPHqcYQOSZf0if4vzJLOcLIVfc5xm2HKyYI3t_To2qKaypIvm4_un0cRpflFwuB8MCodKzYH5rmIQUA_AI1ZEnvQNMgkvED5IQXjfBcnBlxbATdKlqKCChJSZWJFj1E6zFE4Q5kJrrjzhKi4oKBYKU11xEphTIZSm8DlF1xtHR6taLSOqmc8satwUNW4628L2HLWLdQkXBv4LcdnE-wsxtq5O |
| linkProvider | Unpaywall |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFA5zO4gXFScqKjl48dDZNkm3epvDMTyMgQ62U8mPFxX7Y6wton-9SVuniJedcnmE8B7J917yvi8IXSktB6ErwHGJ0g5lwncE1cwZENCeR5Roui2mwWROHxZs0UL-NxdGxWaepHrCt3t6pXQjaMtu7FdyIWG9amRsB3UCZvLvNurMp7PhstHt-cdyD-2W6Yp_vPM4_gUe4_2a0JdXmoO2Z-StVxaiJz__KDJut64D1P0h6-HZBoYOUQvSI7Qcxs-ZqftfkhzzVGFp26d1xXfLsclT8V2WxcBTPHqcYQOSZf0if4vzJLOcLIVfc5xm2HKyYI3t_To2qKaypIvm4_un0cRpflFwuB8MCodKzYH5rmIQUA_AI1ZEnvQNMgkvED5IQXjfBcnBlxbATdKlqKCChJSZWJFj1E6zFE4Q5kJrrjzhKi4oKBYKU11xEphTIZSm8DlF1xtHR6taLSOqmc8satwUNW4628L2HLWLdQkXBv4LcdnE-wsxtq5O |
| 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+54th+Annual+ACM+SIGACT+Symposium+on+Theory+of+Computing&rft.atitle=Algorithms+and+certificates+for+Boolean+CSP+refutation%3A+smoothed+is+no+harder+than+random&rft_id=info:doi/10.1145%2F3519935.3519955&rft.externalDocID=10.1145%2F3519935.3519955 |