Details
| Original language | English |
|---|---|
| Journal | Electronic colloquium on computational complexity (ECCC) |
| Volume | TR12-079 |
| Publication status | Published - 2012 |
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
Verifying Proofs in Constant Depth. / Beyersdorff, Olaf; Datta, Samir; Krebs, Andreas et al.
In: Electronic colloquium on computational complexity (ECCC), Vol. TR12-079, 2012.
In: Electronic colloquium on computational complexity (ECCC), Vol. TR12-079, 2012.
Research output: Contribution to journal › Article › Research › peer review
Beyersdorff, O, Datta, S, Krebs, A, Mahajan, M, Scharfenberger-Fabian, G, Sreenivasaiah, K, Thomas, M & Vollmer, H 2012, 'Verifying Proofs in Constant Depth', Electronic colloquium on computational complexity (ECCC), vol. TR12-079. <https://eccc.weizmann.ac.il/report/2012/079>
Beyersdorff, O., Datta, S., Krebs, A., Mahajan, M., Scharfenberger-Fabian, G., Sreenivasaiah, K., Thomas, M., & Vollmer, H. (2012). Verifying Proofs in Constant Depth. Electronic colloquium on computational complexity (ECCC), TR12-079. https://eccc.weizmann.ac.il/report/2012/079
Beyersdorff O, Datta S, Krebs A, Mahajan M, Scharfenberger-Fabian G, Sreenivasaiah K et al. Verifying Proofs in Constant Depth. Electronic colloquium on computational complexity (ECCC). 2012;TR12-079.
Download
@article{0d64e8addce742b58ea5d51562174874,
title = "Verifying Proofs in Constant Depth",
author = "Olaf Beyersdorff and Samir Datta and Andreas Krebs and Meena Mahajan and Gido Scharfenberger-Fabian and Karteek Sreenivasaiah and Michael Thomas and Heribert Vollmer",
year = "2012",
language = "English",
volume = "TR12-079",
journal = "Electronic colloquium on computational complexity (ECCC)",
}
Download
TY - JOUR
T1 - Verifying Proofs in Constant Depth
AU - Beyersdorff, Olaf
AU - Datta, Samir
AU - Krebs, Andreas
AU - Mahajan, Meena
AU - Scharfenberger-Fabian, Gido
AU - Sreenivasaiah, Karteek
AU - Thomas, Michael
AU - Vollmer, Heribert
PY - 2012
Y1 - 2012
M3 - Article
VL - TR12-079
JO - Electronic colloquium on computational complexity (ECCC)
JF - Electronic colloquium on computational complexity (ECCC)
ER -