612 search results - page 41 / 123 » Hardness assumptions in the foundations of theoretical compu... |
ACMSE
2009
ACM
14 years 9 days ago
2009
ACM
Most recent graphics courses are what we would call topdown courses. Courses that focus on using graphical packages to implement and teach graphics. The course discussed in this p...
FOCS
2007
IEEE
14 years 3 months ago
2007
IEEE
In STOC’05, Ahn, Hopper and Langford introduced the notion of covert computation. A covert computation protocol is one in which parties can run a protocol without knowing if oth...
STACS
2000
Springer
14 years 16 days ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...
STACS
2010
Springer
14 years 3 months ago
2010
Springer
We study computational problems that arise in the context of iterated dominance in anonymous games, and show that deciding whether a game can be solved by means of iterated weak d...
RELMICS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. As part of a larger project, we have built a declarative assembly language that enables us to specify multiple code paths to compute particular quantities, giving the ins...