scientific article; zbMATH DE number 1256714
From MaRDI portal
Publication:4228449
Recommendations
- scientific article; zbMATH DE number 1305544
- Hardness and methods to solve CLIQUE
- Locally testable codes and Cayley graphs
- Test case generators and computational results for the maximum clique problem
- Bounds on \(2\)-query codeword testing
- Hardness of computing clique number and chromatic number for Cayley graphs
- Quadratic algorithms for testing of codes and \(\diamond\)-codes
- Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem
- Combinatorial construction of locally testable codes (extended abstract)
- On the computational hardness of the code equivalence problem in cryptography
Cited in
(9)- Zero knowledge and the chromatic number
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Ramsey theory and integrality gap for the independent set problem
- On weighted vs unweighted versions of combinatorial optimization problems
- Improved non-approximability results for minimum vertex cover with density constraints
- Bridging gap between standard and differential polynomial approximation: The case of bin-packing
- Improved non-approximability results for vertex cover with density constraints
- Cryptography from planted graphs: security with logarithmic-size messages
- Randomness efficient noise stability and generalized small bias sets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228449)
