Please use this identifier to cite or link to this item:
Title: Berekenbaarheid, onberekenbaarheid en compexiteit: een aanvullende studie
Authors: VERMEULEN, Gijs
Issue Date: 2005
Keywords: Context vrije talen, pumping lemma, reduceerbaarheid computatie histories, mapping reduceerbaarheid, recursie theorema, turing reduceerbaarheid, PSPACE-compleetheid, TQBF probleem, relativisatie, uniforme booleaanse circuits
Document URI:
Category: T2
Type: Theses and Dissertations
Appears in Collections:Master theses

Files in This Item:
File Description SizeFormat 
vermeulen-gijs.PDF447.77 kBAdobe PDFView/Open
Show full item record

Page view(s)

checked on May 28, 2022


checked on May 28, 2022

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.