MAX3SAT is exponentially hard to approximate if NP has positive dimension - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

John M. Hitchcock. MAX3SAT is exponentially hard to approximate if NP has positive dimension. Theoretical Computer Science, 289(1):861-869, 2002.

@article{Hitchcock02:0,
  title = {MAX3SAT is exponentially hard to approximate if NP has positive dimension},
  author = {John M. Hitchcock},
  year = {2002},
  researchr = {https://researchr.org/publication/Hitchcock02%3A0},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {289},
  number = {1},
  pages = {861-869},
}

runs on WebDSL