About: Breaking the $2^n$-barrier for Irredundance: Two lines of attack   Goto Sponge  NotDistinct  Permalink

An Entity of Type : owl:Thing, within Data Space : data.idref.fr associated with source document(s)

AttributesValues
Author
Bibliographic Citation
  • Journal of Discrete Algorithms, Elsevier, 2011, 9 (3), pp.214-230
  • Binkele-Raible Daniel, Brankovic Ljiljana, Cygan Marek, Fernau Henning, Kneis Joachim, Kratsch Dieter, Langer Alexander, Liedloff Mathieu, Pilipczuk Marcin, Rossmanith Peter, Wojtaszczyk Jakub Onufry. Breaking the $2^n$-barrier for Irredundance: Two lines of attack. Journal of Discrete Algorithms, Elsevier, 2011, 9 (3), pp.214-230
Title
  • Breaking the $2^n$-barrier for Irredundance: Two lines of attack
dc:date
  • 2011
Faceted Search & Find service v1.13.91 as of Aug 16 2018


Alternative Linked Data Documents: ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data]
OpenLink Virtuoso version 07.20.3229 as of May 14 2019, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (70 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software