Computability in Europe 2008
Logic and Theory of Algorithms
|Slot:||Wed, 16:30-16:50, Amphitheater B (col. 2)|
We discuss the uniform model of computation over groups. We consider P =? NP problems and relativized versions of P, DNP, and NP for groups and for structures which result from extensions of groups.
|websites: Arnold Beckmann||2008-06-06|