2661 search results - page 53 / 533 » Quantum Complexity Classes |
104
click to vote
CIE
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
96
Voted
JSYML
2008
15 years 20 days ago
2008
In a previous paper with M. Dzamonja, class forcings were given which fixed the complexity (a universality covering number) for certain types of structures of size together with ...
101
click to vote
TCC
2009
Springer
16 years 1 months ago
2009
Springer
It is well known that general secure function evaluation (SFE) with information-theoretical (IT) security is infeasible in presence of a corrupted majority in the standard model. ...
101
click to vote
STOC
2005
ACM
16 years 1 months ago
2005
ACM
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
COCO
2007
Springer
15 years 6 months ago
2007
Springer
We study the link between the complexity of a polynomial and that of its coefficient functions. Valiant’s theory is a good setting for this, and we start by generalizing one of V...