Sciweavers

2446 search results - page 98 / 490
» Choiceless Polynomial Time
Sort
View
JC
2006
105views more  JC 2006»
15 years 20 days ago
On the complexity of the resolvent representation of some prime differential ideals
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
Lisi D'Alfonso, Gabriela Jeronimo, Pablo Solern&oa...
105
Voted
SIAMDM
2010
99views more  SIAMDM 2010»
14 years 7 months ago
On the Stable Paths Problem
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...
Penny E. Haxell, Gordon T. Wilfong
89
Voted
ENTCS
2008
102views more  ENTCS 2008»
15 years 23 days ago
Soft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
112
Voted
HPCC
2007
Springer
15 years 6 months ago
Optimizing Performance of Automatic Training Phase for Application Performance Prediction in the Grid
Abstract. Automatic execution time prediction of the Grid applications plays a critical role in making the pervasive Grid more reliable and predictable. However, automatic executio...
Farrukh Nadeem, Radu Prodan, Thomas Fahringer
89
Voted
SODA
2004
ACM
88views Algorithms» more  SODA 2004»
15 years 2 months ago
Constructing finite field extensions with large order elements
In this paper, we present an algorithm that given a fixed prime power q and a positive integer N, finds an integer n [N, 2qN] and an element Fqn of order greater than 5.8n/ log...
Qi Cheng