363 search results - page 46 / 73 » Finding Small Solutions to Small Degree Polynomials |
SIAMDM
2008
13 years 7 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
HICSS
1994
IEEE
13 years 11 months ago
1994
IEEE
We are developing a new problem-solving methodology based on a self-organization paradigm. To realize our future goal of self-organizing computational systems, we have to study co...
ESA
2004
Springer
14 years 1 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...
EUROCRYPT
2004
Springer
14 years 1 months ago
2004
Springer
Generating a distributed key, where a constant fraction of the players can reconstruct the key, is an essential component of many largescale distributed computing tasks such as ful...
VLSID
2006
IEEE
14 years 8 months ago
2006
IEEE
Many formal verification tools today are based on Boolean proof techniques. The two most powerful approaches in this context are Binary Decision Diagrams (BDDs) and methods based ...