Complexity Lower Bounds from Algorithm Design
Since the beginning of the theory of computation, researchers have been fascinated by the prospect of proving impossibility results on computing. When and how can we argue that a task cannot be efficiently solved, no matter what algorithm we try to use?In this short article, I will briefly introduce...
Uložené v:
| Vydané v: | Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science s. 1 - 3 |
|---|---|
| Hlavný autor: | |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
29.06.2021
|
| Predmet: | |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Since the beginning of the theory of computation, researchers have been fascinated by the prospect of proving impossibility results on computing. When and how can we argue that a task cannot be efficiently solved, no matter what algorithm we try to use?In this short article, I will briefly introduce some of the ideas behind a research program in computational complexity that I and others have studied, for the last decade. (The accompanying talk will contain more details.) The program begins with the observations that:(a) Computer scientists know a great deal about how to design efficient algorithms.(b) However, we do not know how to prove many weak-looking complexity lower bounds.It turns out that certain knowledge we have from (a) can be leveraged to prove complexity lower bounds in a systematic way, making progress on (b). For example, progress on faster circuit satisfiability algorithms (even those that barely improve upon exhaustive search) automatically imply circuit complexity lower bounds for interesting functions. 1 |
|---|---|
| AbstractList | Since the beginning of the theory of computation, researchers have been fascinated by the prospect of proving impossibility results on computing. When and how can we argue that a task cannot be efficiently solved, no matter what algorithm we try to use?In this short article, I will briefly introduce some of the ideas behind a research program in computational complexity that I and others have studied, for the last decade. (The accompanying talk will contain more details.) The program begins with the observations that:(a) Computer scientists know a great deal about how to design efficient algorithms.(b) However, we do not know how to prove many weak-looking complexity lower bounds.It turns out that certain knowledge we have from (a) can be leveraged to prove complexity lower bounds in a systematic way, making progress on (b). For example, progress on faster circuit satisfiability algorithms (even those that barely improve upon exhaustive search) automatically imply circuit complexity lower bounds for interesting functions. 1 |
| Author | Williams, R. Ryan |
| Author_xml | – sequence: 1 givenname: R. Ryan surname: Williams fullname: Williams, R. Ryan email: rrw@mit.edu organization: Massachusetts Institute of Technology,Computer Science & Artificial Intelligence Laboratory,Cambridge,Massachusetts,02139 |
| BookMark | eNotj81Kw0AURkdQUGueQJC8QOKd_8yyRquFgIvWdZlkbupIkikzEe3bW7Crj3MWB75bcjmFCQl5oFBSCuaxWdcbyZgSJQNGSyM0nPCCZEZXVCkpRGWkuiZZSl8AwCpNQZgbUtRhPAz46-dj3oQfjPlT-J5cyvsYxnw57EP08-eYP2Py--mOXPV2SJidd0E-Vi_b-q1o3l_X9bIpLKvMXGgNvNXAUKHhXGrluoqCtLLjEpXuHCDTjlqjWtYzeZKilZJyJzrTql7zBbn_73pE3B2iH2087s6n-B_sDUNg |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1109/LICS52264.2021.9470522 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP) 1998-present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Xplore url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 9781665448956 1665448954 |
| EndPage | 3 |
| ExternalDocumentID | 9470522 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IH ACM ALMA_UNASSIGNED_HOLDINGS APO CBEJK GUFHI LHSKQ RIE RIO |
| ID | FETCH-LOGICAL-a289t-7703b702e6e933576dc8105a5c35e67cd0e27d1a96b2f2535e4b5513d4c9b6f73 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000947350400009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 02:26:37 EDT 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a289t-7703b702e6e933576dc8105a5c35e67cd0e27d1a96b2f2535e4b5513d4c9b6f73 |
| PageCount | 3 |
| ParticipantIDs | ieee_primary_9470522 |
| PublicationCentury | 2000 |
| PublicationDate | 2021-June-29 |
| PublicationDateYYYYMMDD | 2021-06-29 |
| PublicationDate_xml | – month: 06 year: 2021 text: 2021-June-29 day: 29 |
| PublicationDecade | 2020 |
| PublicationTitle | Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science |
| PublicationTitleAbbrev | LICS |
| PublicationYear | 2021 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0002871049 |
| Score | 2.1481056 |
| Snippet | Since the beginning of the theory of computation, researchers have been fascinated by the prospect of proving impossibility results on computing. When and how... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1 |
| SubjectTerms | Computational complexity Computer science Systematics Task analysis |
| Title | Complexity Lower Bounds from Algorithm Design |
| URI | https://ieeexplore.ieee.org/document/9470522 |
| WOSCitedRecordID | wos000947350400009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NSwMxEB3a4sFT1Vb8JgePbrub7Cabo1aLQikFP-itJJtZLWgr7Vbw35vZrhXBi7cwEEK-yMvkvTyA88SvEuuUC8jYNog1N0GqDZEdZCIM-hVdkjGfBmo4TMdjParBxUYLg4gl-Qw7VCzf8t08W1GqrKtjFXq8UIe6Umqt1drkUwj5e7RbiYCjUHcHd717QheUOeFRp6r8y0WlPET6zf81vwPtHzUeG23OmV2o4WwPmt92DKzanS0IKET_WxafbEDmZ-yKPJOWjCQk7PL1eb6YFi9v7LokbbThsX_z0LsNKjeEwPhLUeFhcCisCjlK1EL4a4LLUg-OTJKJBKXKXIhcuchoaXnOEx-MLbm3uDjTVuZK7ENjNp_hAbAclY1dLhWiiYWN0tRpEVlt8xCN5NEhtKj3k_f1hxeTquNHf4ePYZsGmPhTXJ9Ao1is8BS2so9iulyclbP0BXelkUo |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1dS8MwFA1zCvo0dRO_zYOPdmuTtGkedSob1jFwyt5G0tzqQDfZOsF_b25XJ4IvvoULgXySk5tzcgg5D90qMVZaD41tPaGY9mKlkewQhVyDW9EFGfMpkb1ePByqfoVcrLQwAFCQz6CJxeIt307TBabKWkpI3-GFNbIeCsGCpVprlVFB7O_wbikDDnzVSrrtB8QXmDthQbOs_stHpThGbmv_a8A2afzo8Wh_ddLskApMdknt25CBlvuzTjwM4Q-X-SdN0P6MXqFr0pyiiIRevj5PZ-P85Y1eF7SNBnm8vRm0O17ph-Bpdy3KHRD2uZE-gwgU5-6iYNPYwSMdpjyESKbWByZtoFVkWMZCFxQG_VusSJWJMsn3SHUyncA-oRlII2wWSQAtuAni2CoeGGUyH3TEggNSx96P3pdfXozKjh_-HT4jm53BfTJKur27I7KFg41sKqaOSTWfLeCEbKQf-Xg-Oy1m7As465SR |
| 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+36th+Annual+ACM%2FIEEE+Symposium+on+Logic+in+Computer+Science&rft.atitle=Complexity+Lower+Bounds+from+Algorithm+Design&rft.au=Williams%2C+R.+Ryan&rft.date=2021-06-29&rft.pub=IEEE&rft.spage=1&rft.epage=3&rft_id=info:doi/10.1109%2FLICS52264.2021.9470522&rft.externalDocID=9470522 |