3228 search results - page 615 / 646 » Computationally Sound Proofs |
ICALP
2007
Springer
14 years 2 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
TELETRAFFIC
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We focus in this paper on passive traffic measurement techniques that collect traces of TCP packets and analyze them to derive, for example, round-trip times or aggregate...
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
SPAA
2006
ACM
14 years 2 months ago
2006
ACM
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
ICDCS
2005
IEEE
14 years 2 months ago
2005
IEEE
We prove two theorems saying that no distributed system in which processes coordinate using reliable registers and -resilient services can solve the consensus problem in the prese...