Minimal achievable approximation ratio for MAX-MQ in finite fields

DOI10.1016/J.TCS.2009.02.003zbMATH Open1168.68052OpenAlexW2089939069MaRDI QIDQ1019747FDOQ1019747

Authors: Shangwei Zhao, Xiao-Shan Gao 

Publication date: 28 May 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.02.003

Recommendations

• A well-characterized approximation problem
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• On the hardness of approximating max-satisfy
• scientific article; zbMATH DE number 2119705
• Satisfying degree-\(d\) equations over \(\mathrm{GF}[2]^{n}\)

zbMATH Keywords

approximation algorithmapproximation ratioMAX-MQmultivariate quadratic polynomial equations

Mathematics Subject Classification ID

Approximation algorithms (68W25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)

Cites Work

• Title not available (Why is that?)
• Some optimal inapproximability results
• A well-characterized approximation problem
• Title not available (Why is that?)

Cited In (5)

• A New Approximate Min-Max Theorem with Applications in Cryptography
• Polly cracker, revisited
• A new method for solving polynomial systems with noise over \(\mathbb{F}_2\) and its applications in cold boot key recovery
• On the bounds and achievability about the ODPC of \(\mathrm{GRM}(2,m)^*\) over prime fields for increasing message length
• Solving polynomial systems with noise over \(\mathbb{F}_2\): revisited

This page was built for publication: Minimal achievable approximation ratio for MAX-MQ in finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1019747)