48 search results - page 2 / 10 » Lattices of Relatively Axiomatizable Classes |
WCRE
2003
IEEE
13 years 11 months ago
2003
IEEE
This paper promotes the use of a mathematical concept lattice based upon the binary relation of accesses between methods and fields as a novel visualization of individual JAVA cl...
COMBINATORICS
2002
13 years 6 months ago
2002
We investigate the numbers dk of all (isomorphism classes of) distributive lattices with k elements, or, equivalently, of (unlabeled) posets with k antichains. Closely related and...
TAPOS
1998
13 years 5 months ago
1998
Building and maintaining the class hierarchy has been recognized as an important but one of the most difficult activities of object-oriented design. Concept (or Galois) lattices a...
EUROCRYPT
2006
Springer
13 years 10 months ago
2006
Springer
NTRU is a very efficient public-key cryptosystem based on polynomial arithmetic. Its security is related to the hardness of lattice problems in a very special class of lattices. Th...
AML
2006
13 years 6 months ago
2006
Simpson introduced the lattice P of 0 1 classes under Medvedev reducibility. Questions regarding completeness in P are related to questions about measure and randomness. We presen...