Nondeterministic Instance Complexity and Proof Systems with Advice

Beyersdorff, O, Koebler, J and Mueller, S (2009) Nondeterministic Instance Complexity and Proof Systems with Advice. In: Dediu, AH, Ionescu, AM and Martin-Vide, C, (eds.) Language and Automata Theory and Applications. Third International Conference, LATA 2009, 2-8 April 2009, Tarragona, Spain. Lecture Notes in Computer Science, 5457 . Springer Verlag , 164 - 175 . ISBN 978-3-642-00981-5

Abstract

Metadata

Authors/Creators:
  • Beyersdorff, O
  • Koebler, J
  • Mueller, S
Copyright, Publisher and Additional Information: © 2009, Springer Verlag. This is an author produced version of a paper published in Language and Automata Theory and Applications. Uploaded in accordance with the publisher's self-archiving policy. The original publication is available at www.springerlink.com
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds) > Institute for Computational and Systems Science (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 10 Dec 2012 10:48
Last Modified: 17 Sep 2016 00:23
Published Version: http://dx.doi.org/10.1007/978-3-642-00982-2_14
Status: Published
Publisher: Springer Verlag
Identification Number: 10.1007/978-3-642-00982-2_14

Download

Filename: nic_rev.pdf

Share / Export

Statistics