Sciweavers

38 search results - page 5 / 8
» The Degree of Regularity of HFE Systems
Sort
View
FOCS
1999
IEEE
15 years 1 months ago
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus
This paper is concerned with the complexity of proofs and of searching for proofs in two propositional proof systems: Resolution and Polynomial Calculus (PC). For the former syste...
Maria Luisa Bonet, Nicola Galesi
CASC
2007
Springer
108views Mathematics» more  CASC 2007»
15 years 3 months ago
Comprehensive Triangular Decomposition
We introduce the concept of comprehensive triangular decomposition (CTD) for a parametric polynomial system F with coefficients in a field. In broad words, this is a finite part...
Changbo Chen, Oleg Golubitsky, François Lem...
SIGMETRICS
2005
ACM
15 years 3 months ago
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
—To model P2P networks that are commonly faced with high rates of churn and random departure decisions by end-users, this paper investigates the resilience of random graphs to li...
Derek Leonard, Vivek Rai, Dmitri Loguinov
ITICSE
2004
ACM
15 years 2 months ago
Generation as method for explorative learning in computer science education
The use of generic and generative methods for the development and application of interactive educational software is a relatively unexplored area in industry and education. Advant...
Andreas Kerren
CONCURRENCY
2006
140views more  CONCURRENCY 2006»
14 years 9 months ago
An efficient memory operations optimization technique for vector loops on Itanium 2 processors
To keep up with a large degree of instruction level parallelism (ILP), the Itanium 2 cache systems use a complex organization scheme: load/store queues, banking and interleaving. ...
William Jalby, Christophe Lemuet, Sid Ahmed Ali To...