Back to Results
First PageMeta Content



GAME THEORY IN FORMAL VERIFICATION SCRIBE NOTES FOR LECTURE 5 THOMAS NOWAK 1. Parity Objectives 1.1. Definition. Consider a graph (S, E). Let d be a non-negative integer and
Add to Reading List

Document Date: 2010-04-23 02:11:21


Open Document

File Size: 157,25 KB

Share Result on Facebook
UPDATE