![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Guillaume Malod (University of Mons-Hainaut, Belgium)
Friday 08 June 2007, 14:00-15:00
Valiant's theory
- đ¤ Speaker: Guillaume Malod (University of Mons-Hainaut, Belgium)
- đ Date & Time: Friday 08 June 2007, 14:00 - 15:00
- đ Venue: FW11
Questions? Contact
Tom Ridge
Abstract
Valiant’s theory is often described as a model of computation over fields and compared to the generalized Turing machines of Blum, Shub and Smale. I will present it more as a theory of computations by arithmetic circuits. I will give the basic definitions and results and introduce some of the main open problems in the field.
Series This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Computing and Mathematics
- Department of Computer Science and Technology talks and seminars
- FW11
- Interested Talks
- Logic and Semantics Seminar (Computer Laboratory)
- Martin's interesting talks
- School of Technology
- tcw57âs list
- Trust & Technology Initiative - interesting events
- yk373's list
- yk449
Note: Ex-directory lists are not shown.