1998 search results - page 126 / 400 » Complexity of the Cover Polynomial |
148
click to vote
COCO
2004
Springer
15 years 12 months ago
2004
Springer
We study the robustness of complete sets for various complexity classes. A complete set A is robust if for any f(n)-dense set S ∈ P, A−S is still complete, where f(n) ranges f...
222
click to vote
STOC
1999
ACM
15 years 10 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
184
click to vote
ISSS
1999
IEEE
15 years 10 months ago
1999
IEEE
In order to cope with the ever increasing complexity of todays application specific integrated circuits, a building block based design methodology is established. The system is co...
188
click to vote
ARGMAS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In this paper, we propose a new strategic and tactic reasoning for agent communication. This reasoning framework is specified using argumentation theory combined to a rel...
195
click to vote
FCT
2007
Springer
15 years 8 months ago
2007
Springer
The diameter of an undirected graph is the minimal number d such that there is a path between any two vertices of the graph of length at most d. The radius of a graph is the minim...