#### Filter Results:

- Full text PDF available (10)

#### Publication Year

1990

2010

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Vivek Gore, Mark Jerrum
- STOC
- 1997

The SwendsennWang process provides one possible dynamics for the q-state Potts model. Computer simulations of this process are widely used to estimate the expectations of various observables (random variables) of a Potts system in the equilibrium (or Gibbs) distribution. The legitimacy of such simulations depends on the rate of convergence of the process to… (More)

- Vivek Gore, Mark Jerrum, Sampath Kannan, Elizabeth Sweedyk, Stephen R. Mahaney
- Inf. Comput.
- 1997

A quasi-polynomial-time algorithm is presented for sampling almost uniformly at random from the n-slice of the language L(G) generated by an arbitrary context-free grammar G. (The n-slice of a language L over an alphabet is the subset L\ n of words of length exactly n.) The time complexity of the algorithm is " ?2 (n jGj) O(log n) , where the parameter "… (More)

- Eric Allender, Vivek Gore
- SIAM J. Comput.
- 1994

We show that uniform families of ACC circuits of subexponential size cannot compute the permanent function. This also implies similar lower bounds for certain sets in PP. This is one of the very few examples of a lower bound in circuit complexity where the uniformity condition is essential; it is still unknown if there is any set in Ntime (2 n O(1)) that… (More)

- Eric Allender, Vivek Gore
- Inf. Process. Lett.
- 1991

We show that log-bounded rudimentary reductions (deened and studied by Jones in 1975) characterize Dlogtime-uniform AC 0 .

- Eric Allender, Vivek Gore
- 1995

A preliminary version of this paper appeared as AG91a]. 1 SUMMARY As part of a study of almost-everywhere complex sets, we investigate sets that are immune to AC 0 ; that is, sets with no innnite subset in AC 0. We show that such sets exist in P PP and in DSPACE(log n log n). Our main result is an oracle construction indicating that any improvement in these… (More)

- Eric Allender, Vivek Gore
- Advances In Computational Complexity Theory
- 1990

1 SUMMARY As part of a study of almost-everywhere complex sets, we i n vestigate sets that are immune to AC 0 ; that is, sets with no innnite subset in AC 0. W e show that such sets exist in P PP and in DSPACElog n log n. Our main result is an oracle construction indicating that any improvement in these immunity results will represent a signiicant advance,… (More)

- A M Goodwin, V Gore
- The British journal of medical psychology
- 2000

The task of nursing people with severe and enduring mental illness can evoke stresses and anxieties for staff which are not consciously known about, but which, nevertheless, impinge upon the quality of care delivered. As a way of exploring this issue, the interactions between staff and between staff and residents in long-term residential care were observed.… (More)

- E. K. S. Vijayakumar, V. G. Gore, A. Mahajan, M. Kumar
- Indian journal of pharmaceutical sciences
- 2010

A new process impurity was detected during the HPLC analysis of Tizanidine hydrochloride (I) batches. The impurity (II) was isolated by preparative HPLC and characterized by NMR and Mass spectral analysis as 5-S-ethyl-N-(4,5-dihydro-1H-imidazol-2-yl)-2,1,3-benzothiadiazol-4-amine hydrochloride.

- Shiyu Zhou, Michael Saks, +6 authors David Zuckerman
- 1996

One of the important issues in both complexity theory and algorithm design is to understand whether randomness can be more powerful than determinism. In this dissertation, we explore some problems related to this issue and study how to reduce randomness in computation via explicit combinatorial constructions. One approach to achieving determinism from… (More)

- Vivek Gore, Mark Jerrum
- 1995

A quasi-polynomial-time algorithm is presented for sampling almost uniformly at random from the n-slice of the language L(G) generated by an arbitrary context-free grammar G. (The n-slice of a language L over an alphabet is the subset L\ n of words of length exactly n.) The time complexity of the algorithm is " ?2 (n jGj) O(log n) , where the parameter "… (More)