2479 search results - page 65 / 496 » Quantum complexity theory |
SIGECOM
2011
ACM
13 years 1 months ago
2011
ACM
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
BICOB
2010
Springer
14 years 3 months ago
2010
Springer
In this paper we investigate the structure and representation of n-ary algebras arising from DNA recombination, where n is a number of DNA segments participating in recombination. ...
STACS
2010
Springer
14 years 5 months ago
2010
Springer
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...
FOCS
2003
IEEE
14 years 3 months ago
2003
IEEE
We consider coGapSV P√ n, a gap version of the shortest vector in a lattice problem. This problem is known to be in AM ∩coNP but is not known to be in NP or in MA. We prove th...
ASC
2008
13 years 10 months ago
2008
Morphic Computing is based on Field Theory [14-16] and more specifically Morphic Fields. Morphic Fields were first introduced by [18] from his hypothesis of formative causation tha...