Pages that link to "Item:Q1356888"
From MaRDI portal
The following pages link to The hardness of approximate optima in lattices, codes, and systems of linear equations (Q1356888):
Displaying 27 items.
- When a Constant Classifier is as Good as Any Linear Classifier (Q2890111) (← links)
- Complexity of lattice problems. Non-approximability and limits of non-approximability (Q2922519) (← links)
- Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with $2^{(\log {n})^{\Omega(1)}}$ Colors (Q2968154) (← links)
- Approximability of Capacitated Network Design (Q3009752) (← links)
- On Tree-Constrained Matchings and Generalizations (Q3012795) (← links)
- New Results on the Complexity of the Max- and Min-Rep Problems (Q3075522) (← links)
- The Geometry of Lattice Cryptography (Q3092183) (← links)
- Training a Single Sigmoidal Neuron Is Hard (Q4409384) (← links)
- On the limits of non-approximability of lattice problems (Q4542514) (← links)
- NP-Hardness of Reed--Solomon Decoding, and the Prouhet--Tarry--Escott Problem (Q4581908) (← links)
- Hardness of approximating the minimum distance of a linear code (Q4679877) (← links)
- Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH (Q5002683) (← links)
- Meta-heuristic approaches to solve shortest lattice vector problem (Q5035010) (← links)
- (Q5091252) (← links)
- Hardness of bounded distance decoding on lattices in lp norms (Q5092487) (← links)
- Intractability of assembly sequencing: Unit disks in the plane (Q5096948) (← links)
- On the hardness of approximate and exact (bichromatic) maximum inner product (Q5140838) (← links)
- 𝜔-categorical structures avoiding height 1 identities (Q5141754) (← links)
- Algorithmic Problems for Metrics on Permutation Groups (Q5448642) (← links)
- The Next Whisky Bar (Q5740176) (← links)
- On the maximum edge-pair embedding bipartite matching (Q5918365) (← links)
- Comment (Q5965645) (← links)
- Positive-unlabeled classification under class-prior shift: a prior-invariant approach based on density ratio estimation (Q6106437) (← links)
- Mathematics of computation through the lens of linear equations and lattices (Q6198651) (← links)
- Keeping it sparse: computing persistent homology revisited (Q6601459) (← links)
- Statistical computational learning (Q6602226) (← links)
- Parameterized inapproximability of the minimum distance problem over all fields and the shortest vector problem in all \(\ell_{p}\) norms (Q6621748) (← links)
