25 search results - page 1 / 5 » The mathematics of Bruce Rothschild |
JCT
2006
13 years 11 months ago
2006
A review is given of some of the mathematical research of Bruce Rothschild, emphasizing his results in combinatorial theory, especially that part known as Ramsey Theory. Special em...
DM
1999
13 years 10 months ago
1999
We say (n, e) (m, f), an (m, f) subgraph is forced, if every n-vertex graph of size e has an m-vertex spanned subgraph with f edges. For example, as Tur
ICSR
2009
Springer
13 years 9 months ago
2009
Springer
Anecdotal experience constructing proofs of correctness of code built from reusable software components reveals that they tend to be relatively trivial bookkeeping exercises: they ...
ISSAC
1999
Springer
14 years 3 months ago
1999
Springer
DAC
2001
ACM
15 years 4 days ago
2001
ACM
An approach for factoring general boolean functions was described in [15, 16] which is based on graph partitioning algorithms. In this paper, we present a very fast algorithm for ...