1220 search results - page 39 / 244 » Restricting grammatical complexity |
TIT
2008
13 years 7 months ago
2008
Abstract--We study continuous-time multidimensional widesense stationary (WSS) and (almost) cyclostationary processes in the frequency domain. Under the assumption that the correla...
LATINCRYPT
2010
13 years 6 months ago
2010
We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We...
SIAMJO
2010
13 years 6 months ago
2010
The imposition of general disjunctions of the form “πx ≤ π0 ∨ πx ≥ π0 + 1”, where π, π0 are integer valued, is a fundamental operation in both the branch-and-bound...
AIML
2004
13 years 9 months ago
2004
abstract. The aim of the present paper is to analyze the complexity of strict implication (together with falsum, conjunction and disjunction). We prove that Ladner's Theorem r...
PODS
2010
ACM
14 years 21 days ago
2010
ACM
Abiteboul et al. initiated the systematic study of distributed XML documents consisting of several logical parts, possibly located on different machines. The physical distributio...