Search Results

Check these references: Cohen, D.M.; Dalal, S.R.; Parelius, J.; Patton, G.C., The combinatorial design approach to automatic test generation Cohen, D.M.; Dalal, S.R.; Fredman, M.L.; Pat …

This paper, Computational complexities of Diophantine equations with parameters by Tung, proves co-NP-completeness of a variant with parameters over natural numbers.

There could other types of failures. For example, some of the processors (e.g. under broadcast or multicast protocols) may become overloaded and would not be able to process all incoming messages. Thi …

Mandelbrot set $M$ is defined using the complex equation $P_c (z)=z^2 +c$ where $c$ is a complex number. Let Set $M=${$c |$ the sequence $P_c (0),P_c (P_c (0)), P_c (P_c (P_c (0)))...$ is bounded su …

I guess there is no consensus among researchers and academics on the security of Bitcoin protocol. Thanks to Stack Exchange Network, The following links should help you to answer some of your question …

Ball and Trap I remains $W[1]$-hard when restricted to binary trees. Theorem 5 states: Theorem 5. Ball and Trap I remains $W[1]$-hard restricted to binary trees, the maximum number of traps per …

There is a list of open problems in computational geometry. It is edited and maintained by Demaine, Mitchell, and O'Rourke.

This survey book, Satisfiability Problem: Theory and Applications, is appropriate for introducing k-SAT to mathematicians. It is not very recent but still very valuable resource.

If you do not insist on a database, the Encyclopedia of algorithms By Ming-Yang Kao is very valuable reference. The above link is the entry for the minimum Bandwidth problem. This is an encycloped …

The result of Khuller and Vazirani shows that finding the lexicographically first four-coloring for planar graphs is $NP$-hard.

Manuel Blum is talking about applying Levin's universal search algorithm to the Integer Factorization problem. The idea of Levin's Universal search algorithm is equally applicable to any problem in $N …

This survey, The structure and function of complex networks by Newman, reviews techniques and models for real complex networks including concepts such as small-world effect, degree distributions, and …

The actual proof of the $NP$-hardness of computing Cheeger constant ( or edge expansion) was given by Kaibel in a technical report by a reduction from MAX Cut problem (See theorem 2). The proof is an …

The paper, Knowledge, Creativity and P versus NP by Avi Wigderson is an excellent exposition of the P vs NP problem's implications on the philosophical question of automating creativity.

What are some of the major open issues of theoretical computer science applied to biology? Here is a nice presentation, Open questions in bioinformatics and computational biology from an evolutio …