Discrete Algorithms and Complexity : Proceedings of the Japan-US Joint Seminar, June 4-6, 1986, Kyoto, Japan.

Mostrar otras versiones (1)

Discrete Algorithms and Complexity.

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores Corporativos: Nihon Gakujutsu Shinkōkai, National Science Foundation (U.S.), Japan-US Joint Seminar on Discrete Algorithms and Complexity Theory
Otros Autores: Johnson, David S., 1945-, Nishizeki, T. (Takao), 1947-2022, Nozaki, Akihiro, 1936-, Wilf, Herbert S., 1931-2012
Formato: Electrónico Congresos, conferencias eBook
Idioma:Inglés
Publicado: Orlando : Academic Press, 1987.
Colección:Perspectives in computing (Boston, Mass.) ; vol. 15.
Temas:
Computer programming > Congresses.
Computer algorithms > Congresses.
Computational complexity > Congresses.
Programmation (Informatique) > Congrès.
Algorithmes > Congrès.
Complexité de calcul (Informatique) > Congrès.
MATHEMATICS > General.
Computational complexity
Computer algorithms
Computer programming
Conference papers and proceedings
Acceso en línea:Texto completo
Descripción
Sumario:Discrete Algorithms and Complexity.
Notas:Electronic Prototyping.
Descripción Física:1 online resource (497 pages)
Bibliografía:ReferencesChapter 9. Fast, Rigorous Factorisation and Diecrete Logarltha Algoritluas; 1. Introduction; 2. A riaoroua version of the elliptic curve factorinamethod; 3. Factoring with random squares; 4. Discrete logarithes In GF (pages); 5. DISCRETE LOGARITHMS OVERGF (2n); REFERENCES; Chapter 10. Redundant Coding for Local Computability; 1. Introduction; 2. Coding and Local Computability; 3. Addition on Residue Class; 4. High-speed Parallel Computation of Operations on Finite Abelian Group; 5. Applications; 6. Conclusion; Acknowledgement; References.
ISBN:9781483274003
1483274004

Ejemplares similares