Approaching simple and powerful service-computing<sup>1</sup> (Q3498554)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5275902
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approaching simple and powerful service-computing<sup>1</sup> |
scientific article; zbMATH DE number 5275902 |
Statements
Approaching simple and powerful service-computing<sup>1</sup> (English)
0 references
15 May 2008
0 references
service-computing
0 references
interaction complexity
0 references
automaton
0 references
computability
0 references
0.7675484418869019
0 references
0.6913551688194275
0 references
0.6837025284767151
0 references
0.6700882315635681
0 references
