Combinatorial Computing, Algorithms, Cryptography, Complexity

The specific problems of particular interest are algorithms for hard problems like: Ramsey numbers, combinatorial designs, arithmetic of large integers, tests for primality, factoring into primes and other combinatorial problems in graph theory. The general problems of particular interest are in the complexity of algorithms, hierarchies of complexity classes and related areas, such as P=NP conjecture.

My past and current projects are best clustered into the domains: Ramsey numbers | graph theory | applied cryptography | combinatorial designs | miscellaneous.

Main Results

I was fortunate to obtain some interesting results in computational discrete mathematics, of which the most cherished are:

CPU intensive computations on networked computers are an essential tool and an object of study for most researched problems, including those listed above.

back to spr's main page