1391 search results - page 37 / 279 » Complexity Limitations on Quantum Computation |
COCO
2003
Springer
14 years 29 days ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
DCC
2001
IEEE
14 years 7 months ago
2001
IEEE
The automorphism group of the Barnes-Wall lattice Lm in dimension 2m (m = 3) is a subgroup of index 2 in a certain "Clifford group" Cm of structure 21+2m + .O+ (2m, 2). ...
FOCS
2002
IEEE
14 years 20 days ago
2002
IEEE
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in ModkP for each k ≥ 2). We derive this result as a corollary of a more g...
ICDCSW
2005
IEEE
14 years 1 months ago
2005
IEEE
Displaying and navigating complex information on wearable computers is very different from accessing the same information while sitting at your desk. Limitations in hardware, scre...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
We exactly determine the formula size of the parity function. If n = 2 + k, where 0 ≤ k < 2 , then the formula size of parity on n bits is 2 (2 + 3k) = n2 + k2 − k2 . Khrap...