Bitkomplexität der Maximumbestimmung in allgemeinen und speziellen Graphen.
The bit complexity of maximum finding by normal and special graphs
Saved in:
Personal Name(s): | Unruh, E. |
---|---|
Imprint: |
Braunschweig :
Technische Universität Braunschweig,
1990.
|
Physical Description: |
III, 106 S. |
Note: |
deutsch |
Subject (ZB): | |
Classification: |
LEADER | 00858cam a2200253 n 4500 | ||
---|---|---|---|
001 | 34898 | ||
005 | 19970514000000.0 | ||
008 | r1990 | ||
035 | |a (Sirsi) a37668 | ||
084 | 0 | |a DCA - Informatics - theoretical |2 ZB | |
245 | 0 | 0 | |a Bitkomplexität der Maximumbestimmung in allgemeinen und speziellen Graphen. |
260 | |a Braunschweig : |b Technische Universität Braunschweig, |c 1990. | ||
300 | |a III, 106 S. | ||
500 | |a deutsch | ||
520 | |a The bit complexity of maximum finding by normal and special graphs | ||
596 | |a 1 | ||
650 | 4 | |a distributed system | |
650 | 4 | |a network | |
650 | 4 | |a graph | |
700 | 1 | |a Unruh, E. | |
710 | 2 | |a Technische Universität (Braunschweig) | |
900 | |a B 068270'01' | ||
908 | |a Hochschulschrift | ||
949 | |a B 068270'01' |w LC |c 1 |i 1091102034 |l STACKS |m ZB |r Y |s Y |t ZBHS |u 25/3/2009 |x ZB-D |1 PRINT |2 HS |