Conference paper
On the evaluation of powers and related problems
Nicholas Pippenger
FOCS 1976
The assertion of the title is formulated and proved. The result is then used to construct graphs with a linear number of edges that, even after the deletion of almost all of their edges or almost all of their vertices, continue to contain all small trees. © 1987 Akadémiai Kiadó.
Nicholas Pippenger
FOCS 1976
Nicholas Pippenger, Martin Charles Golumbic
Journal of Combinatorial Theory, Series B
Mark Kleiman, Nicholas Pippenger
Theoretical Computer Science
Roy Adler, Bruce Kitchens, et al.
IEEE Trans. Inf. Theory