A low complexity probabilistic test for integer multiplication
- Grigoriev, Dima
- Tenenbaum, Gérald
DOIAbstract
AbstractA probabilistic test for equality a=bc for given n-bit integers a,b,c is designed within complexity n(loglogn)exp{O(log∗n)}
AbstractA probabilistic test for equality a=bc for given n-bit integers a,b,c is designed within complexity n(loglogn)exp{O(log∗n)}
It is known that bounded error probabilistic polynomial time (BPP) languages are accepted by polynom...
NP = PCP(log n; 1) and related results crucially depend upon the close connection between the probab...
Attention has been paid mostly to the new deterministic algorithm for primality testing AKS recently...
AbstractA probabilistic test for equality a=bc for given n-bit integers a,b,c is designed within com...
AbstractGeneral properties and proof techniques concerning probabilistic complexity classes are disc...
We show a construction of a PCP with both sub-constant error and almost-linear size. Specifically, f...
AbstractWe analyse two recent probabilistic primality testing algorithms; the first one is derived f...
In computers, pseudo-random numbers are usually generated through a linear congruential sequence. C...
Noam Nisan constructed pseudo random number generators which convert O(S log R) truly random bits to...
AbstractWe present a practical probabilistic algorithm for testing large numbers of arbitrary form f...
Deciding equivalence of probabilistic automata is a key problem for establishing various behavioural...
It is well known that the hardest bit of integer multiplication is the middle bit, i.e. MULn−1,n. Th...
We provide a zero-knowledge argument for arithmetic circuit satisfiability with a communication comp...
AbstractWe describe probabilistic primality tests applicable to integers whose prime factors are all...
AbstractGiven inputs x1,…,xn, which are independent identically distributed random variables over a ...
It is known that bounded error probabilistic polynomial time (BPP) languages are accepted by polynom...
NP = PCP(log n; 1) and related results crucially depend upon the close connection between the probab...
Attention has been paid mostly to the new deterministic algorithm for primality testing AKS recently...
AbstractA probabilistic test for equality a=bc for given n-bit integers a,b,c is designed within com...
AbstractGeneral properties and proof techniques concerning probabilistic complexity classes are disc...
We show a construction of a PCP with both sub-constant error and almost-linear size. Specifically, f...
AbstractWe analyse two recent probabilistic primality testing algorithms; the first one is derived f...
In computers, pseudo-random numbers are usually generated through a linear congruential sequence. C...
Noam Nisan constructed pseudo random number generators which convert O(S log R) truly random bits to...
AbstractWe present a practical probabilistic algorithm for testing large numbers of arbitrary form f...
Deciding equivalence of probabilistic automata is a key problem for establishing various behavioural...
It is well known that the hardest bit of integer multiplication is the middle bit, i.e. MULn−1,n. Th...
We provide a zero-knowledge argument for arithmetic circuit satisfiability with a communication comp...
AbstractWe describe probabilistic primality tests applicable to integers whose prime factors are all...
AbstractGiven inputs x1,…,xn, which are independent identically distributed random variables over a ...
It is known that bounded error probabilistic polynomial time (BPP) languages are accepted by polynom...
NP = PCP(log n; 1) and related results crucially depend upon the close connection between the probab...
Attention has been paid mostly to the new deterministic algorithm for primality testing AKS recently...
Add to ORKG