X-Nico

unusual facts about Complexity theory


Derrick Gosselin

He specializes in decision making in complex and turbulent environments (Wicked problems, Futures Studies, Complexity theory).


Collision problem

The r-to-1 collision problem is an important theoretical problem in complexity theory, quantum computing, and computational mathematics.


see also

Dspace

DSPACE, a complexity measure in computational complexity theory

Network Analysis and Ethnographic Problems

If the book combines complexity theory following lines of thought at the Santa Fe Institute with a contribution to understanding of Middle Eastern social structure, it is through combining network visualization and analysis with the study of the dynamics of marriage choices.

Permanent is sharp-P-complete

The computational complexity of the permanent also has some significance in other aspects of complexity theory: it is not known whether NC equals P (informally, whether every polynomially-solvable problem can be solved by a polylogarithmic-time parallel algorithm) and Ketan Mulmuley has suggested an approach to resolving this question that relies on writing the permanent as the determinant of a matrix.