Completeness and reduction in algebraic complexity theory Peter Bürgisser

By:

Series: Algorithms and computation in mathematics ; v. 7Publication details: Berlin New York Springer c2000Description: xii, 168 p. ill. 24 cmISBN:

Subject(s):

DDC classification:

LOC classification:

Online resources:

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Call number	Status	Date due	Barcode
Carti	IMAR	511.3 (Browse shelf(Opens below))	Available		0037382

Previous			No cover image available		No cover image available			Next
Previous	511.8-WAL Identifiability of state space models, with applications to transformation systems /	511.8-WOR Algebras in genetics /	511.8-ZIO Multiple criteria problem solving : proceedings of a conference, Buffalo, N.Y. (U.S.A.), August 22-26, 1977	511.3 Completeness and reduction in algebraic complexity theory	511.3 -AIS Logic, Automata, and Algorithms	511.32 Sperner theory	511.33 Semimodular lattices : theory and applications /	Next

ENG

BIBLIOGRAFIE P. 149
INDEX P. 163

There are no comments on this title.

to post a comment.