Sciweavers

2210 search results - page 78 / 442
» CLEF 2001 - Overview of Results
Sort
View
CALC
2001
Springer
201views Cryptology» more  CALC 2001»
14 years 2 months ago
Finding Small Solutions to Small Degree Polynomials
Abstract. This talk is a brief survey of recent results and ideas concerning the problem of finding a small root of a univariate polynomial mod N, and the companion problem of fi...
Don Coppersmith
CP
2001
Springer
14 years 2 months ago
GAC on Conjunctions of Constraints
Abstract. Applying GAC on conjunctions of constraints can lead to more powerful pruning [1]. We show that there exists a simple heuristic for deciding which constraints might be us...
George Katsirelos, Fahiem Bacchus
CSL
2001
Springer
14 years 2 months ago
On a Generalisation of Herbrand's Theorem
In this paper we investigate the purely logical rule of term induction, i.e. induction deriving numerals instead of arbitrary terms. In this system it is not possible to bound the ...
Matthias Baaz, Georg Moser
EPIA
2001
Springer
14 years 2 months ago
Evolving Multi-agent Viewpoints - an Architecture
Abstract. We present an approach to agents that can reason, react to the environment and are able to update their own knowledge as a result of new incoming information. Each agents...
Pierangelo Dell'Acqua, João Alexandre Leite...
FCT
2001
Springer
14 years 2 months ago
The Complexity of Maximum Matroid-Greedoid Intersection
Abstract. The maximum intersection problem for a matroid and a greedoid, given by polynomial-time oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in...
Taneli Mielikäinen, Esko Ukkonen