3663 search results - page 326 / 733 » Problems in the ontology of computer programs |
222
click to vote
SIAMCOMP
2010
15 years 5 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
182
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
We prove that QIP(2), the class of problems having two-message quantum interactive proof systems, is a subset of PSPACE. This relationship is obtained by means of an efficient pa...
172
click to vote
ICALP
2007
Springer
16 years 28 days ago
2007
Springer
Valiant’s theory of holographic algorithms is a novel methodology to achieve exponential speedups in computation. A fundamental parameter in holographic algorithms is the dimens...
221
click to vote
ERSHOV
1999
Springer
15 years 11 months ago
1999
Springer
We introduce an object-oriented design pattern called Twin that allows us to model multiple inheritance in programming languages that do not support this feature (e.g. Java, Modula...
191
click to vote
FOSAD
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. There is great interest in applying nominal calculi--computational formalisms that include dynamic name generation--to the problems of programming, specifying, and verify...