Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Ata de Congresso
|
Finding extremal polygonsBoyce, James ; Dobkin, David ; Drysdale, III, Robert ; Guibas, LeoAnnual ACM Symposium on Theory of Computing: Proceedings of the fourteenth annual ACM symposium on Theory of computing; 05-07 May 1982, 1982, p.282-289 [Periódico revisado por pares]ACMTexto completo disponível |
|
2 |
Material Type: Ata de Congresso
|
Some connections between nonuniform and uniform complexity classesKarp, Richard ; Lipton, RichardProceedings of the twelfth annual ACM symposium on theory of computing, 1980, p.302-309 [Periódico revisado por pares]ACMTexto completo disponível |
|
3 |
Material Type: Ata de Congresso
|
Symmetric complementationReif, JohnAnnual ACM Symposium on Theory of Computing: Proceedings of the fourteenth annual ACM symposium on Theory of computing; 05-07 May 1982, 1982, p.201-214 [Periódico revisado por pares]ACMTexto completo disponível |
|
4 |
Material Type: Ata de Congresso
|
The node cost measure for embedding graphs on the planar grid (Extended Abstract)Storer, JamesAnnual ACM Symposium on Theory of Computing: Proceedings of the twelfth annual ACM symposium on Theory of computing; 28-30 Apr. 1980, 1980, p.201-210 [Periódico revisado por pares]ACMTexto completo disponível |
|
5 |
Material Type: Ata de Congresso
|
Graph pebbling with many free pebbles can be difficultCarlson, David ; Savage, JohnAnnual ACM Symposium on Theory of Computing: Proceedings of the twelfth annual ACM symposium on Theory of computing; 28-30 Apr. 1980, 1980, p.326-332 [Periódico revisado por pares]ACMTexto completo disponível |
|
6 |
Material Type: Ata de Congresso
|
Comparative schematology and pebbling with auxiliary pushdowns (Preliminary Version)Pippenger, NicholasAnnual ACM Symposium on Theory of Computing: Proceedings of the twelfth annual ACM symposium on Theory of computing; 28-30 Apr. 1980, 1980, p.351-356 [Periódico revisado por pares]ACMTexto completo disponível |
|
7 |
Material Type: Ata de Congresso
|
The consistency of "P = NP" and related problems with fragments of number theoryDeMillo, Richard ; Lipton, RichardAnnual ACM Symposium on Theory of Computing: Proceedings of the twelfth annual ACM symposium on Theory of computing; 28-30 Apr. 1980, 1980, p.45-57 [Periódico revisado por pares]ACMTexto completo disponível |
|
8 |
Material Type: Ata de Congresso
|
Testing polynomials which are easy to compute (Extended Abstract)Heintz, J ; Schnorr, CAnnual ACM Symposium on Theory of Computing: Proceedings of the twelfth annual ACM symposium on Theory of computing; 28-30 Apr. 1980, 1980, p.262-272 [Periódico revisado por pares]ACMTexto completo disponível |
|
9 |
Material Type: Ata de Congresso
|
A linear-time algorithm for a special case of disjoint set unionGabow, Harold ; Tarjan, RobertProceedings of the fifteenth annual ACM symposium on theory of computing, 1983, p.246-251ACMTexto completo disponível |
|
10 |
Material Type: Ata de Congresso
|
Kraft storage and access for list implementations(Extended Abstract)Brown, DonnaAnnual ACM Symposium on Theory of Computing: Proceedings of the twelfth annual ACM symposium on Theory of computing; 28-30 Apr. 1980, 1980, p.100-107 [Periódico revisado por pares]ACMTexto completo disponível |