A linear delay algorithm for building concept lattices Yang Huang National Center for Biotechnology Information, NLM, NIH Joint work with Martin Farach-Colton work done at Department of Computer Science, Rutgers Universi

First Page		Document Content
Date: 2008-06-23 13:16:32 Theoretical computer science Lattice Formal concept analysis Complete lattice Time complexity Polynomial Ideal lattice cryptography Complemented lattice Abstract algebra Lattice theory Mathematics		A linear delay algorithm for building concept lattices Yang Huang National Center for Biotechnology Information, NLM, NIH Joint work with Martin Farach-Colton work done at Department of Computer Science, Rutgers Universi Add to Reading List Source URL: www.cs.ucr.edu Download Document from Source Website File Size: 565,03 KB Share Document on Facebook

	A COMPLETE WORST-CASE ANALYSIS OF KANNAN’S SHORTEST LATTICE VECTOR ALGORITHM ´† GUILLAUME HANROT∗ AND DAMIEN STEHLE Abstract. Computing a shortest nonzero vector of a given euclidean lattice and computing a closes DocID: 1uAnv - View Document
	Abstract Interpretation, Reloaded Jan Midtgaard Winter School, Day 3 http://janmidtgaard.dk/aiws15/ Saint Petersburg, Russia, 2015 DocID: 1qWVL - View Document
	QuickChecking Static Analysis Properties Jan Midtgaard and Anders Møller Abstract Interpretation Winter School From forthcoming ICST’15 paper DocID: 1qW5m - View Document
	A Catalog of Patterns for Concept Lattice Interpretation in Software Reengineering Muhammad U.Bhatti∗ , Nicolas Anquetil∗ , Marianne Huchard† , and St´ephane Ducasse∗ ∗ RMoD Project-Team INRIA - Lille Nord Eu DocID: 1p0Hu - View Document
	Open problems in Boolean algebras over partially ordered sets Mohamed Bekkali University sidi mohamed ben abdullah (USMBA) Fez, Morocco DocID: 1nQpr - View Document