5634 search results - page 53 / 1127 » About Abstract Classes |
EUROCRYPT
2003
Springer
15 years 4 months ago
2003
Springer
ded abstract of this paper appears in Advances in Cryptology – EUROCRYPT ’03, Lecture Notes in Computer Science Vol. 2656, E. Biham ed., Springer-Verlag, 2003. This is the full...
101
click to vote
IWOCA
2010
Springer
14 years 5 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
FLAIRS
2008
15 years 1 months ago
2008
In this paper we describe a class of a problem of goal satisfaction in mutual exclusion network that can be solved in polynomial time. This problem provides a common basis for rea...
CSDA
2006
14 years 11 months ago
2006
The implementation of a recently suggested class of structural change tests, which test for parameter instability in general parametric models, in the R language for statistical c...
MOC
1998
14 years 10 months ago
1998
A detailed exposition of Kneser’s neighbour method for quadratic lattices over totally real number fields, and of the sub-procedures needed for its implementation, is given. Usi...