- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 1 to 3 of 3 (0.095 seconds)| 1 |
On Lower Bounds for Parity Branching Programs / On Lower Bounds for Parity Branching ProgramsHomeister, Matthias 15 October 2003 (has links)
No description available.
|
| 2 |
Computational Complexity of Tree Evaluation Problems and Branching Program Satisfiability Problems / 木構造関数値評価問題と分岐プログラム充足性問題に対する計算複雑さNagao, Atsuki 23 March 2015 (has links)
京都大学 / 0048 / 新制・課程博士 / 博士(情報学) / 甲第19129号 / 情博第575号 / 新制||情||101(附属図書館) / 32080 / 京都大学大学院情報学研究科通信情報システム専攻 / (主査)教授 岩間 一雄, 教授 髙木 直史, 教授 五十嵐 淳 / 学位規則第4条第1項該当 / Doctor of Informatics / Kyoto University / DFAM
|
| 3 |
Obere und untere Schranken für eingeschränkte Parity-Branchingprogramme / Upper and Lower Bounds for Restricted Parity Branching ProgramsBrosenne, Henrik 18 April 2006 (has links)
No description available.
|
Page generated in 0.0992 seconds