1022 search results - page 96 / 205 » Logspace Complexity of Functions and Structures |
113
click to vote
EUROCRYPT
2000
Springer
15 years 1 months ago
2000
Springer
In a series of papers Patarin proposes new efficient public key systems. A very interesting proposal, called 2-Round Public Key System with S Boxes, or 2R, is based on the difficul...
IJCAI
2001
14 years 11 months ago
2001
Combinatorial auctions provide a valuable mechanism for the allocation of goods in settings where buyer valuations exhibit complex structure with respect to substitutabilityand co...
TCAD
1998
14 years 9 months ago
1998
— Integrated circuits have evolved to a stage where interconnections significantly limit their performance and functional complexity. We introduce a set of tools to perform high...
161
click to vote
VLDB
2002
ACM
15 years 10 months ago
2002
ACM
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function de ned among them, which satis es the trian...
LICS
2006
IEEE
15 years 4 months ago
2006
IEEE
Treewidth measures the ”tree-likeness” of structures. Many NP-complete problems, e.g., propositional satisfiability, are tractable on bounded-treewidth structures. In this wo...