๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The complexity of strict serializability revisited

โœ Scribed by Udo Kelter


Book ID
113163145
Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
413 KB
Volume
25
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


The complexity of constraint satisfactio
โœ Alan K. Mackworth; Eugene C. Freuder ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 327 KB

Mackworth, A.K. and E.C. Freuder, The complexity of constraint satisfaction revisited, Artificial Intelligence 59 (1993) 57-62. This paper is a retrospective account of some of the developments leading up to, and ensuing from, the analysis of the complexity of some polynomial network consistency alg