|
|
|
|
| LEADER |
01108nam a2200301 4500 |
| 001 |
PPN002696940 |
| 005 |
20230327055200.0 |
| 009 |
DYNIX_BUNAN_355042 |
| 010 |
|
|
|a 2-225-82672-2
|
| 100 |
|
|
|a 19990118d1992 u0frey0103 ba
|
| 101 |
0 |
|
|a fre
|
| 102 |
|
|
|a FR
|
| 200 |
0 |
1 |
|a Complexité algorithmique et problèmes de communications
|f J.-P. Barthélemy, G. Cohen, A. Lobstein
|g préf. de M. Minoux
|
| 210 |
|
|
|a Paris
|c Masson
|d 1992
|
| 215 |
|
|
|a 228 p.
|d 24 cm
|
| 225 |
2 |
|
|a Collection technique et scientifique des télécommunications
|
| 606 |
0 |
0 |
|a Algorithmes
|
| 606 |
0 |
0 |
|a Complexité de calcul (informatique)
|
| 606 |
0 |
0 |
|a Communication
|
| 700 |
0 |
1 |
|a Barthélemy
|b Jean-Pierre
|
| 701 |
0 |
1 |
|a Cohen
|b Gérard
|
| 701 |
0 |
1 |
|a Lobstein
|b Antoine
|
| 702 |
0 |
1 |
|a Minoux
|b Michel
|4 080
|
| 801 |
|
|
|a FR
|b DYNIX_BUNAN
|c 19990531
|g AFNOR
|
| 979 |
|
|
|a SCI
|
| 993 |
|
|
|a 1161017274
|b SCI
|c 681.311 BAR
|d EM
|e INFAUT12
|f I
|g 18-01-1999
|h 03-02-2000
|i 04-07-2003
|o 13-12-2003
|p 16
|s 101727
|t EM
|u SCINF12
|v i
|
| 993 |
|
|
|a 0210075992
|b TEC
|c I275
|d EM
|e TECH
|f O
|g 29-05-2002
|h 29-05-2002
|o 28-04-2003
|p 2
|s 007599
|t EM
|u TECH
|v i
|
| 998 |
|
|
|a 152846
|
Nantilus
