DM
2008
13 years 11 months ago
2008
A recent proof that the Grassmannian G1;n;2 of lines of PG(n; 2) has polynomial degree n 2 1 is outlined, and is shown to yield a theorem about certain kinds of subgraphs of any (...
CAV
2010
Springer
14 years 3 months ago
2010
Springer
This paper discusses the obstacles that stand in the way of doing a good job of machine-code analysis. Compared with analysis of source code, the challenge is to drop all assumptio...