Normal view MARC view ISBD view

Subtree Isomorphism and Bipartite Perfect Matchings Are-Mutually NC-Reducible M. Karpinski; A. Lingas

By:

Karpinski, M

Publication details: Berkeley Mathematical Sciences Research Institute 1987Description: 9 p 29 cm

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	III 29610 (Browse shelf(Opens below))	Available		0027807

Browsing IMAR shelves Close shelf browser (Hides shelf browser)

Previous	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	Next
Previous	III 29607 Period Relations and Critical Values of L-Functions	III 29608 Algebraically Defined Subspaces in the Cohomology of a Kuga Fiber Variety	III 29609 Correspondance de Larglands Geometrique pour les Corps de Fonctions	III 29610 Subtree Isomorphism and Bipartite Perfect Matchings Are-Mutually NC-Reducible	III 29611 A Linear Time Algorithm for Computing the Voronoi Diagram of Convex Polygons	III 29612 A Non-Commutative Multiplication of Wiener Functionals and Feynman's Operational Calculus	III 29614 The Heat Expansion for Systems of Integral Equations	Next

Contine bibliografie

There are no comments on this title.

to post a comment.

Print
Add to your cart (remove)
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)

Powered by Koha