344 search results - page 39 / 69 » Some Theorems We Should Prove |
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
We consider several questions inspired by the direct-sum problem in (two-party) communication complexity. In all questions, there are k fixed Boolean functions f1, . . . , fk and ...
VTC
2007
IEEE
14 years 1 months ago
2007
IEEE
—This paper reviews the pertinence and statistical behavior of symbol-spaced tapped-delay-line (TDL) models which are widely used to model wide-sense stationary uncorrelated scat...
DIALM
2003
ACM
14 years 20 days ago
2003
ACM
A common way of storing spatio-temporal information about mobile devices is in the form of a 3D (2D geography + time) trajectory. We argue that when cellular phones and Personal D...
PODS
2007
ACM
14 years 7 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...