Normal view MARC view ISBD view

The computational complexity of algebraic and numeric problems.

Borodin, Allan

The computational complexity of algebraic and numeric problems. - New York : Elsevier, c1975. - 174 p. : diagrs. - Elsevier computer science library : theory of computation series; no. 1 . - Elsevier computer science library : theory of computation series; no. 1 .

Incl. bibliografía: p. 163-172

Subjects--Topical Terms:
ANALISIS NUMERICO
CALCULOS POR ORDENADORES

Universal Decimal Class. No.: 519.61

Place hold
Print
Cite
Add to your cart (remove)
Send to device
Save record
BIBTEX Dublin Core MARCXML MARC (non-Unicode/MARC-8) MARC (Unicode/UTF-8) MARC (Unicode/UTF-8, Standard) MODS (XML) RIS ISBD
More searches

Search for this title in:
Other Libraries (WorldCat) Other Databases (Google Scholar) Online Stores (Bookfinder.com) Open Library (openlibrary.org)