Logical Foundations of Computer Science: Third International Symposium, LFCS '94
67,36 €
Lower bounds for probabilistic space complexity: Communication-automata approach. - On model checking infinite-state systems. - Referential data structures and labeled modal logic. - Yet another correctness criterion for Multiplicative Linear Logic with MIX.
Jetzt bei Ebay:
