2661 search results - page 110 / 533 » Quantum Complexity Classes |
132
click to vote
FOCS
2003
IEEE
15 years 8 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
126
click to vote
COCO
2003
Springer
15 years 8 months ago
2003
Springer
We review and slightly strengthen known results on the Kolmogorov complexity of prefixes of effectively random sequences. First, there are recursively random random sequences su...
101
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
— The problem of designing high rate, full diversity noncoherent space-time block codes (STBCs) with low encoding and decoding complexity is addressed. First, the notion of g-gro...
105
click to vote
STACS
2000
Springer
15 years 6 months ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...
121
click to vote
COMPGEOM
2008
ACM
15 years 5 months ago
2008
ACM
This video presents the working of a new algorithm/software called DelPSC that meshes piecewise smooth complexes in three dimensions with Delaunay simplices. Piecewise smooth comp...