Balanced Max 2-Sat might not be the hardest - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Per Austrin. Balanced Max 2-Sat might not be the hardest. Electronic Colloquium on Computational Complexity (ECCC), 13(088), 2006. [doi]

@article{Austrin06,
  title = {Balanced Max 2-Sat might not be the hardest},
  author = {Per Austrin},
  year = {2006},
  url = {http://eccc.hpi-web.de/eccc-reports/2006/TR06-088/index.html},
  researchr = {https://researchr.org/publication/Austrin06},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume = {13},
  number = {088},
}

runs on WebDSL