8196 search results - page 99 / 1640 » Computational Modeling and Complexity Science |
STACS
2009
Springer
15 years 4 months ago
2009
Springer
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...
MFCS
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. What is information? Frequently spoken about in many contexts, yet nobody has ever been able to define it with mathematical rigor. The best we are left with so far is th...
CSR
2006
Springer
15 years 1 months ago
2006
Springer
We classify the computational complexity of all constraint satisfaction problems where the constraint language is preserved by all permutations of the domain. A constraint languag...
PDC
2004
ACM
15 years 3 months ago
2004
ACM
How can the documentation of concepts for complex sociotechnical systems, such as the adoption of groupware, be incorporated into practices of PD? Documents are important in suppo...
STOC
2001
ACM
15 years 10 months ago
2001
ACM
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...