Details
Original language | Undefined/Unknown |
---|---|
Title of host publication | Mathematical Foundations of Computer Science 2011 |
Subtitle of host publication | 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings |
Pages | 84-95 |
Publication status | Published - 2011 |
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
Mathematical Foundations of Computer Science 2011: 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings. 2011. p. 84-95.
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
}
TY - GEN
T1 - Verifying Proofs in Constant Depth.
AU - Beyersdorff, Olaf
AU - Datta, Samir
AU - Mahajan, Meena
AU - Scharfenberger-Fabian, Gido
AU - Sreenivasaiah, Karteek
AU - Thomas, Michael
AU - Vollmer, Heribert
N1 - Funding information: Research supported by a DAAD/DST grant, DFG grant VO 630/6-2, and by grant N. 20517 from the John Templeton Foundation.
PY - 2011
Y1 - 2011
U2 - 10.1007/978-3-642-22993-0_11
DO - 10.1007/978-3-642-22993-0_11
M3 - Aufsatz in Konferenzband
SP - 84
EP - 95
BT - Mathematical Foundations of Computer Science 2011
ER -