4 search results - page 1 / 1 » The Largest Cap in AG(4, 4) and Its Uniqueness |
DCC
2003
IEEE
14 years 4 months ago
2003
IEEE
We show that 40 is the maximum number of points of a cap in AG(4, 4). Up to semi-linear transformations there is only one such 40-cap. Its group of automorphisms is a semidirect p...
CAP
2010
12 years 11 months ago
2010
Binary Decision Diagrams (BDDs) are widely used in formal verification. They are also widely known for consuming large amounts of memory. For larger problems, a BDD computation wi...
PODC
2005
ACM
13 years 10 months ago
2005
ACM
In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph G = (V, E), non-negative vertex weigh...
SIGMETRICS
2008
ACM
13 years 4 months ago
2008
ACM
OSprof is a versatile, portable, and efficient profiling methodology based on the analysis of latency distributions. Although OSprof has offers several unique benefits and has bee...