Stage-oe-small.jpg

Vortrag242/en

Aus Aifbportal
< Vortrag242
Version vom 11. November 2009, 17:18 Uhr von 127.0.0.1 (Diskussion) (Overridden by AifbPortalExt)
(Unterschied) ← Nächstältere Version | Aktuelle Version (Unterschied) | Nächstjüngere Version → (Unterschied)
Wechseln zu:Navigation, Suche
Decidability and computability for matroids of bounded branch-width



About the Talk

Date: 2004-10-01
Title: Decidability and computability for matroids of bounded branch-width
Author: Detlef Seese


Event:
Name: International Conference on Graph Transformations (ICGT 2004 - September 29th until October 1st, Rome) Satelite Workshop: Logic Graph Transformations, Finite and Infinite Structures
Location: Rom
Country: D

Research Group: Complexity Management