Hypergraph Unreliability in Quasi-Polynomial Time

Cen, Ruoxu; Li, Jason; Panigrahi, Debmalya

doi:10.1145/3618260.3649753

Attention:

The NSF Public Access Repository (PAR) system and access will be unavailable from 11:00 PM ET on Friday, November 14 until 2:00 AM ET on Saturday, November 15 due to maintenance. We apologize for the inconvenience.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.

+ Advanced Search

Citation Details

Hypergraph Unreliability in Quasi-Polynomial Time

Award ID(s):: 2329230 1750140

PAR ID:: 10520517

Author(s) / Creator(s):: Cen, Ruoxu; Li, Jason; Panigrahi, Debmalya

Publisher / Repository:: Proceedings of the 56th Annual ACM}Symposium on Theory of Computing, STOC 2024

Date Published:: 2024-06-10

ISBN:: 9798400703836

Page Range / eLocation ID:: 1700 to 1711

Format(s):: Medium: X

Location:: Vancouver BC Canada

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript1.0
Conference Paper:
https://doi.org/10.1145/3618260.3649753

Last Name:

First Name:

Search Results
Selected Authors

Type in a name, or the first few letters of a name, in one or both of appropriate search boxes above and select the search button. An attempt will be made to match authors that most closely relate to the text you typed.

No authors are currently selected. Choosing "Select These Authors" will enter a blank value for author search in the parent form.

Last Name:

First Name:

Search Results
Selected Editors

Type in a name, or the first few letters of a name, in one or both of appropriate search boxes above and select the search button. An attempt will be made to match editors that most closely relate to the text you typed.

No editors are currently selected. Choosing "Select These Editors" will enter a blank value for editor search in the parent form.

More Like this