Sciweavers

CORR
2002
Springer
91views Education» more  CORR 2002»
13 years 3 months ago
Quantum Random Walks Hit Exponentially Faster
We show that the hitting time of the discrete time quantum random walk on the n-bit hypercube from one corner to its opposite is polynomial in n. This gives the first exponential ...
Julia Kempe
CORR
2002
Springer
97views Education» more  CORR 2002»
13 years 3 months ago
Computing the Noncomputable
Tien D. Kieu
CORR
2002
Springer
115views Education» more  CORR 2002»
13 years 3 months ago
Average-case complexity and decision problems in group theory
Abstract. We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on...
Ilya Kapovich, Alexei G. Myasnikov, Paul Schupp, V...
CORR
2002
Springer
113views Education» more  CORR 2002»
13 years 3 months ago
Generic-case complexity, decision problems in group theory and random walks
We give a precise definition of "generic-case complexity" and show that for a very large class of finitely generated groups the classical decision problems of group theor...
Ilya Kapovich, Alexei G. Myasnikov, Paul Schupp, V...
CORR
2002
Springer
112views Education» more  CORR 2002»
13 years 3 months ago
Determination of the structure of algebraic curvature tensors by means of Young symmetrizers
For a positive definite fundamental tensor all known examples of Osserman algebraic curvature tensors have a typical structure. They can be produced from a metric tensor and a fini...
Bernd Fiedler
CORR
2002
Springer
137views Education» more  CORR 2002»
13 years 3 months ago
On ASGS framework: general requirements and an example of implementation
: In the paper we propose general framework for Automatic Secret Generation and Sharing (ASGS) that should be independent of underlying secret sharing scheme. ASGS allows to preven...
Kamil Kulesza, Zbigniew Kotulski
CORR
2002
Springer
122views Education» more  CORR 2002»
13 years 3 months ago
On alternative approach for verifiable secret sharing
The proposed approach works for any underlying secret sharing scheme. It is based on the concept of verification sets of participants, related to authorized set of participants. T...
Kamil Kulesza, Zbigniew Kotulski, Josef Pieprzyk
CORR
2002
Springer
123views Education» more  CORR 2002»
13 years 3 months ago
Ideal decompositions and computation of tensor normal forms
Abstract. Symmetry properties of r-times covariant tensors T can be described by certain linear subspaces W of the group ring K[Sr] of a symmetric group Sr. If for a class of tenso...
Bernd Fiedler