Approximating Satisfiable Satisfiability Problems - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Luca Trevisan. Approximating Satisfiable Satisfiability Problems. Algorithmica, 28(1):145-172, 2000. [doi]

@article{Trevisan00a,
  title = {Approximating Satisfiable Satisfiability Problems},
  author = {Luca Trevisan},
  year = {2000},
  url = {http://link.springer.de/link/service/journals/00453/contents/00/10035/},
  researchr = {https://researchr.org/publication/Trevisan00a},
  cites = {0},
  citedby = {0},
  journal = {Algorithmica},
  volume = {28},
  number = {1},
  pages = {145-172},
}

runs on WebDSL