- Full text PDF available (69)
- This year (2)
- Last 5 years (20)
- Last 10 years (46)
Journals and Conferences
We present an unconditional deterministic polynomial-time algorithm that determines whether an input number is prime or composite.
In this paper, we formalize two stepwise approaches, based on pseudo-random generators, for proving P 6= NP and its arithmetic analog: Permanent requires superpolynomial sized arithmetic circuits.
We show that proving exponential lower bounds on depth four arithmetic circuits imply exponential lower bounds for unrestricted depth arithmetic circuits. In other words, for exponential sized… (More)
A finite state Markov chain M is often viewed as a probabilistic transition system. An alternative view - which we follow here - is to regard M as a linear transform operating on the space of… (More)
We give a simple and new randomized primality testing algorithm by reducing primality testing for number <i>n</i> to testing if a specific univariate identity over <i>Z<sub>n</sub></i> holds.We also… (More)
We study the class of lazy linear hybrid automata with finite precision. The key features of this class are: – The observation of the continuous state and the rate changes associated with mode… (More)
We study the problem of expressing permanents of matrices as determinants of (possibly larger) matrices. This problem has close connections to the complexity of arithmetic computations: the… (More)
We investigate the computational complexity of the Boolean Isomorphism problem (BI): on input of two Boolean formulas F and G decide whether there exists a permutation of the variables of G such that… (More)