1763 search results - page 230 / 353 » A Formalization of Polytime Functions |
ISAAC
2009
Springer
15 years 4 months ago
2009
Springer
We study the following question, communicated to us by Mikl´os Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0, 1}w )3 → {0, 1}w be computed by word...
MODELS
2009
Springer
15 years 4 months ago
2009
Springer
The proliferation of smart spaces and emergence of new standards, such as Web Services, have paved the way for a new breed of software systems. Often the complete functional and Qo...
QSIC
2007
IEEE
15 years 4 months ago
2007
IEEE
In semantics-based component retrieval ontology is usually employed as the semantic basis for component representation and matching. Existing methods always assume that the ontolo...
CCS
2007
ACM
15 years 4 months ago
2007
ACM
We construct two new multiparty digital signature schemes that allow multiple signers to sequentially produce a compact, fixed-length signature. First, we introduce a new primiti...
CONCUR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We propose a new operational model for shared variable concurrency, in the context of a concurrent, higher-order imperative language `a la ML. In our model the scheduling...