Go to the corresponding Portal 
Bläser, Markus ; Hoffmann, Christian
pdfformat: 

@InProceedings{blser_et_al:LIPIcs:2008:1337, author = {Markus Bl{\"a}ser and Christian Hoffmann}, title = {{On the Complexity of the Interlace Polynomial}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {97108}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897064}, ISSN = {18688969}, year = {2008}, volume = {1}, editor = {Susanne Albers and Pascal Weil}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2008/1337}, URN = {urn:nbn:de:0030drops13378}, doi = {http://dx.doi.org/10.4230/LIPIcs.STACS.2008.1337}, annote = {Keywords: Computational complexity, approximation, interlace polynomial, independent set polynomial, graph transformation} }
Keywords:  Computational complexity, approximation, interlace polynomial, independent set polynomial, graph transformation  
Seminar:  25th International Symposium on Theoretical Aspects of Computer Science  
Issue Date:  2008  
Date of publication:  06.02.2008 