10447 search results - page 2015 / 2090 » The Philosophy of Computer Science |
87
Voted
COCO
2009
Springer
15 years 7 months ago
2009
Springer
—In 1982, Kannan showed that ΣP 2 does not have nk -sized circuits for any k. Do smaller classes also admit such circuit lower bounds? Despite several improvements of Kannan’s...
106
Voted
ECSQARU
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. This paper presents a method which allows for merging beliefs expressed thanks to logic programming with stable model semantics. This method is based on the syntactic mer...
125
Voted
ERSHOV
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Debugging virtual machines (VMs) presents unique challenges, especially meta-circular VMs, which are written in the same language they implement. Making sense of runtime ...
105
Voted
ESA
2009
Springer
15 years 7 months ago
2009
Springer
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
80
Voted
FSTTCS
2009
Springer
15 years 7 months ago
2009
Springer
ABSTRACT. We study functionally private approximations. An approximation function g is functionally private with respect to f if, for any input x, g(x) reveals no more information ...