Theoretical estimates of the running time of algorithms for the Boolean formula satisfiability problem

More works in this specialty

1. Methods of analysis and calculation of probabilistic characteristics of multiservice loss networks

   Yarkina, Natalya Viktorovna · 2006 · Candidate of Sciences

   • 05.13.17 Theoretical foundations of informatics
2. Development of models and algorithms for assessing the quality of the higher education system

   Etezov, Bektur Bakhautdinovich · 2006 · Candidate of Sciences

   • 05.13.17 Theoretical foundations of informatics
3. Development of methods and an application software package for the formation and training of neural networks using feedforward and fully connected architectures

   Eigin, Yuri Aleksandrovich · 2006 · Candidate of Sciences

   • 05.13.17 Theoretical foundations of informatics
4. Extension of predicate formulas by linear inequalities and lists for the specification of programs

   Ashraf Abd El-Fattah Mustafa Darwish · 2006 · Candidate of Sciences

   • 05.13.17 Theoretical foundations of informatics
5. Models for searching for regularities and synthesizing knowledge in the medico-biological databases of a human operator

   Chepikov, Eduard Vasilyevich · 2005 · Candidate of Sciences

   • 05.13.18 Mathematical modeling, numerical methods and software complexes
   • 05.13.17 Theoretical foundations of informatics

All works in this specialty