On the Complexity of Adding Convergence

Alex Klinkhamer, Ali Ebnenasir

Open source

DOI
10.1007/978-3-642-40213-5_2
Published
2013
Container
Lecture Notes in Computer Science
Publisher
Springer Berlin Heidelberg
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1007/978-3-642-40213-5_2,
  title = {On the Complexity of Adding Convergence},
  author = {Alex Klinkhamer and Ali Ebnenasir},
  year = {2013},
  journal = {Lecture Notes in Computer Science},
  doi = {10.1007/978-3-642-40213-5_2},
  url = {https://doi.org/10.1007/978-3-642-40213-5_2}
}

RIS

TY  - JOUR
TI  - On the Complexity of Adding Convergence
AU  - Alex Klinkhamer
AU  - Ali Ebnenasir
PY  - 2013
JO  - Lecture Notes in Computer Science
DO  - 10.1007/978-3-642-40213-5_2
UR  - https://doi.org/10.1007/978-3-642-40213-5_2
ER  - 

APA

Klinkhamer, A., & Ebnenasir, A. (2013). On the Complexity of Adding Convergence. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-40213-5_2

Source records