- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: Fundamentals of computation theory. Berlin [u.a.], 1985, S. 300-309
- Klassifikation
-
Allgemeines, Wissenschaft
- Ereignis
-
Veröffentlichung
- (wo)
-
Paderborn
- (wer)
-
Universitätsbibliothek
- (wann)
-
1985
- Urheber
- URN
-
urn:nbn:de:hbz:466:2-4408
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:48 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Monien, Burkhard
- Universitätsbibliothek
Entstanden
- 1985
Ähnliche Objekte (12)
Tree partite graphs and the complexity of algorithms
Simulating binary trees on x-trees
Self-embedding and complexity in oral registers
Approximate tree embedding for querying XML data
Temporal Knowledge Graph Embedding and Reasoning
The Steiner tree problem : a tour through graphs, algorithms, and complexity
Embedding spanning bounded degree graphs in randomly perturbed graphs
A complexity-theoretic approach to disproving Connes' Embedding Problem
Paging binary trees with external balancing
Binary search trees, rectangles and patterns
Counting, grafting and evolving binary trees
Documenting Knowledge Graph Embedding and Link Prediction using Knowledge Graphs
Tree partite graphs and the complexity of algorithms
Simulating binary trees on x-trees
Self-embedding and complexity in oral registers
Approximate tree embedding for querying XML data
Temporal Knowledge Graph Embedding and Reasoning
The Steiner tree problem : a tour through graphs, algorithms, and complexity
Embedding spanning bounded degree graphs in randomly perturbed graphs
A complexity-theoretic approach to disproving Connes' Embedding Problem
Paging binary trees with external balancing
Binary search trees, rectangles and patterns
Counting, grafting and evolving binary trees
Documenting Knowledge Graph Embedding and Link Prediction using Knowledge Graphs
Tree partite graphs and the complexity of algorithms
Simulating binary trees on x-trees
Self-embedding and complexity in oral registers
Approximate tree embedding for querying XML data
Temporal Knowledge Graph Embedding and Reasoning
The Steiner tree problem : a tour through graphs, algorithms, and complexity
Embedding spanning bounded degree graphs in randomly perturbed graphs
A complexity-theoretic approach to disproving Connes' Embedding Problem
Paging binary trees with external balancing
Binary search trees, rectangles and patterns
Counting, grafting and evolving binary trees