Sciweavers

2446 search results - page 364 / 490
» Choiceless Polynomial Time
Sort
View
ECCC
2000
93views more  ECCC 2000»
14 years 10 months ago
Security of the Most Significant Bits of the Shamir Message Passing Scheme
Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a "hidden" element of a finite field Fp of p elements from rather short strings of...
Maria Isabel Gonzalez Vasco, Igor Shparlinski
JC
2000
135views more  JC 2000»
14 years 10 months ago
Decision Problems in Quadratic Function Fields of High Genus
This paper provides verification procedures for a number of decision problems in quadratic function fields of odd characteristic, thereby establishing membership of these problems...
Renate Scheidler
PC
2000
93views Management» more  PC 2000»
14 years 10 months ago
Scheduling outtrees of height one in the LogP model
The LogP model is a model of parallel computation that characterises a parallel computer system by four parameters: the latency L, the overhead o, the gap g and the number of proc...
Jacques Verriet
DM
1998
57views more  DM 1998»
14 years 9 months ago
Note on alternating directed cycles
The problem of the existence of an alternating simple dicycle in a 2-arc-coloured digraph is considered. This is a generalization of the alternating cycle problem in 2-edgecoloure...
Gregory Gutin, Benny Sudakov, Anders Yeo
82
Voted
JSYML
2002
92views more  JSYML 2002»
14 years 9 months ago
Groundwork for Weak Analysis
Abstract. This paper develops the very basic notions of analysis in a weak secondorder theory of arithmetic BTFA whose provably total functions are the polynomial time computable f...
António M. Fernandes, Fernando Ferreira