Compact Descriptions for Efficient Algorithms

Nebel M (2007)
In: 9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20 - 22, 2007. 27--40.

Download
No fulltext has been uploaded. References only!
Conference Paper | English

No fulltext has been uploaded

Publishing Year
PUB-ID

Cite this

Nebel M. Compact Descriptions for Efficient Algorithms. In: 9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20 - 22, 2007. 2007: 27--40.
Nebel, M. (2007). Compact Descriptions for Efficient Algorithms. 9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20 - 22, 2007, 27--40.
Nebel, M. (2007). “Compact Descriptions for Efficient Algorithms” in 9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20 - 22, 2007 27--40.
Nebel, M., 2007. Compact Descriptions for Efficient Algorithms. In 9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20 - 22, 2007. pp. 27--40.
M. Nebel, “Compact Descriptions for Efficient Algorithms”, 9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20 - 22, 2007, 2007, pp.27--40.
Nebel, M.: Compact Descriptions for Efficient Algorithms. 9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20 - 22, 2007. p. 27--40. (2007).
Nebel, Markus. “Compact Descriptions for Efficient Algorithms”. 9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20 - 22, 2007. 2007. 27--40.
This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Search this title in

Google Scholar