900 search results - page 74 / 180 » On Polynomial Time Computation over Unordered Structures |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems--such as for ...
ICDCS
2007
IEEE
14 years 3 months ago
2007
IEEE
Effective mechanisms for detecting and thwarting Distributed Denial-of-Service (DDoS) attacks are becoming increasingly important to the success of today’s Internet as a viable ...
ESA
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
IACR
2011
12 years 8 months ago
2011
We put forward a framework for the modular design and analysis of multi-party protocols. Our framework is called “GNUC” (with the recursive meaning “GNUC’s Not UC”), alr...
SPDP
1993
IEEE
14 years 29 days ago
1993
IEEE
We consider the problem of transforming a given sequential implementation of a data structure into a wait-free concurrent implementation. Given the code for different operations ...