%0 Conference Paper %1 conf/icfca/GelyMNR05 %A Gély, Alain %A Medina, Raoul %A Nourine, Lhouari %A Renaud, Yoan %B ICFCA %D 2005 %E Ganter, Bernhard %E Godin, Robert %I Springer %K 2017 P-Clone complexity fca seminar %P 235-248 %T Uncovering and Reducing Hidden Combinatorics in Guigues-Duquenne Bases. %U http://dblp.uni-trier.de/db/conf/icfca/icfca2005.html#GelyMNR05 %V 3403 %@ 3-540-24525-1

@inproceedings{conf/icfca/GelyMNR05, added-at = {2017-08-07T17:34:12.000+0200}, author = {Gély, Alain and Medina, Raoul and Nourine, Lhouari and Renaud, Yoan}, biburl = {https://www.bibsonomy.org/bibtex/2ed16d3339a5cb163b090253a69ccbbfa/johirth}, booktitle = {ICFCA}, crossref = {conf/icfca/2005}, editor = {Ganter, Bernhard and Godin, Robert}, ee = {http://dx.doi.org/10.1007/978-3-540-32262-7_16}, interhash = {8ef4c5ff7aa80814bccafc4d0410c89f}, intrahash = {ed16d3339a5cb163b090253a69ccbbfa}, isbn = {3-540-24525-1}, keywords = {2017 P-Clone complexity fca seminar}, pages = {235-248}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2017-08-07T17:34:12.000+0200}, title = {Uncovering and Reducing Hidden Combinatorics in Guigues-Duquenne Bases.}, url = {http://dblp.uni-trier.de/db/conf/icfca/icfca2005.html#GelyMNR05}, volume = 3403, year = 2005 }