SS03, Computer Laboratory
Contact: No managers listed
2 upcoming talks View 1 archived talk
Complexity of Satisfiability in Kochen-Specker Partial Boolean Algebras
Please see above for contact details for this list.
| COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![]() |
|
If you have a question about this list, please contact: (no managers). If you have a question about a specific talk, click on that talk to find its organiser. 2 upcoming talks and 1 talk in the archive. Logic and Semantics Seminar (Computer Laboratory) Complexity of Satisfiability in Kochen-Specker Partial Boolean Algebras
Please see above for contact details for this list. |
Other listsList 1 Wolfson Lecture Theatre, Churchill College, Storeys Way, Cambridge Museum of Archaeology & AnthropologyOther talksWelcome Reception and Poster Session When Programmes Disagree About Programmes: Code Poetry and the Problem of Programme–Programme Communication Shape modes of CP^1 vortices Title to be confirmed Online Causal Inference Seminar Title TBC |