Result 1 to 11 of 11 total
Counting with combined splitting and capture‒recapture methods. (English)
Stoch. Models 28, No. 3, 478-502 (2012).
1
A class of hypergraphs and vertices of cut polytope relaxations. (English)
Dokl. Math. 85, No. 1, 46-47 (2012); translation from Dokl. Akad. Nauk, Ross. Akad. Nauk 442, No. 3, 300-302 (2012).
2
Maximum satisfiability and subexponential time. (English)
Feferman, Solomon (ed.) et al., Proofs, categories and computations. Essays in honor of Grigori Mints. With the collaboration of Vladik Kreinovich, Vladimir Lifschitz, and Ruy de Queiroz. London: College Publications (ISBN 978-1-84890-012-7/pbk). Tributes 13, 81-91 (2010).
3
A numerical approach to 3-SAT. (English)
Adv. Comput. Sci. Eng. 4, No. 1, 89-92 (2010).
4
Computationally hard problems: 3-SAT and its polynomial solvability. (English)
J. Indian Acad. Math. 31, No. 2, 407-444 (2009).
5
An optical wavelength-based solution to the 3-SAT problem. (English)
Dolev, Shlomi (ed.) et al., Optical supercomputing. Second international workshop, OSC 2009, Bertinoro, Italy, November 18‒20, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-10441-1/pbk). Lecture Notes in Computer Science 5882, 77-85 (2009).
6
Signaling-pathway-based molecular computing for efficient 3-SAT problem solving. (English)
Inf. Sci. 161, No. 3-4, 121-137 (2004).
7
The unsatisfiability threshold revisited. (English)
Kautz, Henry (ed.) et al., LICS 2001 workshop on theory and application of satisfiability testing (SAT 2001). Boston, MA, USA, June 14-15, 2001. Amsterdam: Elsevier, Electron. Notes Discrete Math. 9, no pag., electronic only (2001).
8
On the computational complexity of the maximum trade problem. (English)
Acta Math. Appl. Sin., Engl. Ser. 10, No. 4, 434-440 (1994).
9
Counting linear extensions. (English)
Order 8, No.3, 225-242 (1991).
10
Probabilistic analysis of two heuristics for the 3-satisfiability problem. (English)
SIAM J. Comput. 15, 1106-1118 (1986).
11
Result 1 to 11 of 11 total
Start
Contact
Print
General Help
