| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Shenoy K. B. Ajitha, Somenath Biswas, Piyush P. Kurur |
Metropolis algorithm for solving shortest lattice vector problem (SVP).  |
HIS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Swagato Sanyal, Raja S, Somenath Biswas |
Necessary and sufficient conditions for success of the metropolis algorithm for optimization. |
GECCO |
2010 |
DBLP DOI BibTeX RDF |
rapid mixing of markov chains, success of markov chain families, optimization, metropolis algorithm |
| 1 | Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, Frank Neumann |
Computing single source shortest paths using single-objective fitness. |
FOGA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Seshadhri Comandur, Anil Seth, Somenath Biswas |
RAM Simulation of BGS Model of Abstract-state Machines. |
Fundam. Inform. |
2007 |
DBLP BibTeX RDF |
|
| 1 | Vinay Choudhary, Anand Kumar Sinha, Somenath Biswas |
Universality for Nondeterministic Logspace. |
LATA |
2007 |
DBLP BibTeX RDF |
|
| 1 | Seshadhri Comandur, Anil Seth, Somenath Biswas |
RAM Simulation of BGS Model of Abstract State Machines. |
Abstract State Machines |
2005 |
DBLP BibTeX RDF |
|
| 1 | Ranjith Vasireddy, Somenath Biswas |
Modeling Gene Regulatory Network in Fission Yeast Cell Cycle Using Hybrid Petri Nets. |
ICONIP |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Somenath Biswas |
Primality and identity testing via Chinese remaindering. |
J. ACM |
2003 |
DBLP DOI BibTeX RDF |
Primality testing, polynomial identity testing |
| 1 | Manindra Agrawal, Somenath Biswas |
Reducing Randomness via Chinese Remaindering |
Electronic Colloquium on Computational Complexity (ECCC) |
1999 |
DBLP BibTeX RDF |
|
| 1 | Samarjit Chakraborty, Somenath Biswas |
Approximation Algorithms for 3-D Commom Substructure Identification in Drug and Protein Molecules. |
WADS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Somenath Biswas |
Primality and Identity Testing via Chinese Remaindering. |
FOCS |
1999 |
DBLP DOI BibTeX RDF |
Primality testing, Polynomial identity testing |
| 1 | Manindra Agrawal, Somenath Biswas |
NP-Creative Sets: A New Class of Creative Sets in NP. |
Mathematical Systems Theory |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Somenath Biswas |
Polynomial-Time Isomorphism of 1-L-Complete Sets. |
J. Comput. Syst. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Somenath Biswas |
Polynomial Isomorphism of 1-L-Complete Sets. |
Structure in Complexity Theory Conference |
1993 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal, Somenath Biswas |
Universal Relations. |
Structure in Complexity Theory Conference |
1992 |
DBLP BibTeX RDF |
|
| 1 | Sanjeev N. Khadilkar, Somenath Biswas |
Padding, Commitment and Self-Reducibility. |
Theor. Comput. Sci. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Somenath Biswas |
Edge-Deletion Graph Problems with First-Order Expressible Subgraph Properties. |
Int. J. Found. Comput. Sci. |
1991 |
DBLP BibTeX RDF |
|
| 1 | Somenath Biswas, Kesav V. Nori (eds.) |
Foundations of Software Technology and Theoretical Computer Science, 11th Conference, New Delhi, India, December 17-19, 1991, Proceedings |
FSTTCS |
1991 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Somenath Biswas |
On Some Bandwidth Restricted Versions of the Satisfiability Problem of Propositional CNF Formulas. |
Theor. Comput. Sci. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Somenath Biswas |
An O(n²) Algorithm for the Satisfiability Problem of a Subset of Propositional Sentences in CNF That Includes All Horn Sentences. |
Inf. Process. Lett. |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Somenath Biswas |
Expressibility of First Order Logic with a Nondeterministic Inductive Operator. |
STACS |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Somenath Biswas |
On Certain Bandwidth Restricted Versions of the Satisfaiability Problem of Propositional CNF Formulas. |
FSTTCS |
1987 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")