Pages that link to "Item:Q2368586"
From MaRDI portal
The following pages link to The hardness of 3-uniform hypergraph coloring (Q2368586):
Displaying 33 items.
- Extended box clustering for classification problems (Q724605) (← links)
- Committee polyhedral separability: complexity and polynomial approximation (Q890319) (← links)
- PCPs via the low-degree long code and hardness for constrained hypergraph coloring (Q891178) (← links)
- On the complexity of SNP block partitioning under the perfect phylogeny model (Q1045048) (← links)
- Strong inapproximability results on balanced rainbow-colorable hypergraphs (Q1715058) (← links)
- Partitioning the vertices of a cubic graph into two total dominating sets (Q2030435) (← links)
- Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs (Q2067633) (← links)
- Beyond PCSP (\textbf{1-in-3}, \textbf{NAE}) (Q2105441) (← links)
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions (Q2238714) (← links)
- Parallel computations and committee constructions (Q2458086) (← links)
- The complexity of properly learning simple concept classes (Q2462500) (← links)
- Constructive generation of very hard 3-colorability instances (Q2467358) (← links)
- An expected polynomial time algorithm for coloring 2-colorable 3-graphs (Q2851504) (← links)
- Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes (Q2968149) (← links)
- Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with $2^{(\log {n})^{\Omega(1)}}$ Colors (Q2968154) (← links)
- Hardness of Approximate Hypergraph Coloring (Q3149889) (← links)
- Simultaneous Approximation of Constraint Satisfaction Problems (Q3448785) (← links)
- Decision Trees and Influences of Variables Over Product Probability Spaces (Q3557496) (← links)
- Coloring Graphs with Constraints on Connectivity (Q4978449) (← links)
- The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
- NP-hardness of coloring 2-colorable hypergraph with poly-logarithmically many colors (Q5002681) (← links)
- (Q5092401) (← links)
- Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy (Q5096441) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- Hardness of Rainbow Coloring Hypergraphs (Q5136325) (← links)
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5217824) (← links)
- (Q5870293) (← links)
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5875467) (← links)
- CLAP: A New Algorithm for Promise CSPs (Q5885595) (← links)
- Topology and Adjunction in Promise Constraint Satisfaction (Q5885596) (← links)
- On the structure of the set of panchromatic colorings of a random hypergraph (Q6148171) (← links)
- Geometric, algebraic and topological combinatorics. Abstracts from the workshop held December 10--15, 2023 (Q6613402) (← links)
- Coloring tournaments with few colors: algorithms and complexity (Q6654122) (← links)