Sciweavers

200 search results - page 11 / 40
» ipl 2006
Sort
View
IPL
2006
88views more  IPL 2006»
15 years 1 months ago
Improved construction for universality of determinant and permanent
Valiant (1979) proved that every polynomial of formula size e is a projection of the (e + 2)
Hong Liu, Kenneth W. Regan
IPL
2006
71views more  IPL 2006»
15 years 1 months ago
Analysis of improved signcryption scheme with key privacy
In this paper, we analyse the Yang
Chik How Tan
IPL
1998
68views more  IPL 1998»
15 years 1 months ago
Fast Nondeterministic Recognition of Context-Free Languages Using two Queues
We show how to accept a context-free language nondeterministically in O( n log n) time on a two-queue machine.
Burton Rosenberg
IPL
2000
95views more  IPL 2000»
15 years 1 months ago
An efficient upper bound of the rotation distance of binary trees
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons ...
Jean Marcel Pallo
IPL
2006
104views more  IPL 2006»
15 years 1 months ago
Optimal register allocation for SSA-form programs in polynomial time
This paper gives a constructive proof that the register allocation problem for a uniform register set is solvable in polynomial time for SSA-form programs. 2006 Elsevier B.V. All ...
Sebastian Hack, Gerhard Goos