4488 search results - page 272 / 898 » Properties of NP-Complete Sets |
197
click to vote
CTRSA
2009
Springer
16 years 1 months ago
2009
Springer
In the setting of multiparty computation a set of parties with private inputs wish to compute some joint function of their inputs, whilst preserving certain security properties (l...
183
click to vote
CP
2007
Springer
16 years 29 days ago
2007
Springer
Abstract There has been considerable interest in the identification of structural properties of combinatorial problems that lead to efficient algorithms for solving them. Some of...
179
click to vote
AMEC
2004
Springer
16 years 6 days ago
2004
Springer
Abstract. In many settings, bidding agents for auctions do not know their preferences a priori. Instead, they must actively determine them through deliberation (e.g., information p...
186
click to vote
CSL
2010
Springer
15 years 8 months ago
2010
Springer
This paper provides an induction rule that can be used to prove properties of data structures whose types are inductive, i.e., are carriers of initial algebras of functors. Our res...
185
click to vote
JCSS
2000
15 years 6 months ago
2000
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic ( 1 1), which allows sentences c...