Transparent long proofs: A first PCP theorem for NPr.

Klaus Meer

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

OriginalsprogEngelsk
Titel31st International Colloquium on Automata, Languages and Programming
RedaktørerJ. Diaz, J. Karhum, A. Lepist, D. Sannella
Vol/bindbd.3142
Publikationsdato2004
Sider959-970
StatusUdgivet - 2004
Begivenhed31st International Colloquium on Automata, Languages and Programming - Berlin, Tyskland
Varighed: 24. aug. 2010 → …
Konferencens nummer: 31

Konference

Konference31st International Colloquium on Automata, Languages and Programming
Nummer31
LandTyskland
ByBerlin
Periode24/08/2010 → …

Citer dette

Meer, K. (2004). Transparent long proofs: A first PCP theorem for NPr. I J. Diaz, J. Karhum, A. Lepist, & D. Sannella (red.), 31st International Colloquium on Automata, Languages and Programming (Bind bd.3142, s. 959-970)
Meer, Klaus. / Transparent long proofs: A first PCP theorem for NPr. 31st International Colloquium on Automata, Languages and Programming. red. / J. Diaz ; J. Karhum ; A. Lepist ; D. Sannella. Bind bd.3142 2004. s. 959-970
@inproceedings{b9944020f3c111db821c000ea68e967b,
title = "Transparent long proofs: A first PCP theorem for NPr.",
author = "Klaus Meer",
note = "Lecture Notes in Computer Science Springer",
year = "2004",
language = "English",
volume = "bd.3142",
pages = "959--970",
editor = "J. Diaz and J. Karhum and A. Lepist and D. Sannella",
booktitle = "31st International Colloquium on Automata, Languages and Programming",

}

Meer, K 2004, Transparent long proofs: A first PCP theorem for NPr. i J Diaz, J Karhum, A Lepist & D Sannella (red), 31st International Colloquium on Automata, Languages and Programming. bind bd.3142, s. 959-970, 31st International Colloquium on Automata, Languages and Programming, Berlin, Tyskland, 24/08/2010.

Transparent long proofs: A first PCP theorem for NPr. / Meer, Klaus.

31st International Colloquium on Automata, Languages and Programming. red. / J. Diaz; J. Karhum; A. Lepist; D. Sannella. Bind bd.3142 2004. s. 959-970.

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

TY - GEN

T1 - Transparent long proofs: A first PCP theorem for NPr.

AU - Meer, Klaus

N1 - Lecture Notes in Computer Science Springer

PY - 2004

Y1 - 2004

M3 - Article in proceedings

VL - bd.3142

SP - 959

EP - 970

BT - 31st International Colloquium on Automata, Languages and Programming

A2 - Diaz, J.

A2 - Karhum, J.

A2 - Lepist, A.

A2 - Sannella, D.

ER -

Meer K. Transparent long proofs: A first PCP theorem for NPr. I Diaz J, Karhum J, Lepist A, Sannella D, red., 31st International Colloquium on Automata, Languages and Programming. Bind bd.3142. 2004. s. 959-970