2430 search results - page 217 / 486 » Computing Tutte Polynomials |
152
click to vote
ERSHOV
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We define the first nontrivial polynomially recognizable subclass of P-matrix Generalized Linear Complementarity Problems (GLCPs) with a subexponential pivot rule. No suc...
124
click to vote
ASIACRYPT
1991
Springer
15 years 8 months ago
1991
Springer
In [1] a construction of a block cipher from a single pseudorandom permutation is proposed. In a complexity theoretical setting they prove that this scheme is secure against a pol...
162
click to vote
BIRTHDAY
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Probabilistic systems of interacting intelligent agents are considered. They have two sources of uncertainty: uncertainty of communication channels and uncertainty of act...
120
click to vote
CIE
2006
Springer
15 years 6 months ago
2006
Springer
In Bishop-style constructive algebra it is known that if a module over a commutative ring has a Noetherian basis function, then it is Noetherian. Using countable choice we prove th...
126
click to vote
ISMB
1997
15 years 5 months ago
1997
Seq7 is a newprogramfor generating multiple structure-based alignments of RNAsequences. Byusing a variant of Dijkstra’s algorithm to find the shortest path through a specially c...