8196 search results - page 156 / 1640 » Computational Modeling and Complexity Science |
191
click to vote
CC
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
228
click to vote
ACMSE
2011
ACM
14 years 6 months ago
2011
ACM
This paper describes the adaptation of a modern compiler construction course to target an FPGA-based hardware platform used throughout our computer science curriculum. One of the ...
172
click to vote
ICALP
2007
Springer
16 years 17 days ago
2007
Springer
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
156
click to vote
ICTCS
2005
Springer
15 years 12 months ago
2005
Springer
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...
176
click to vote
VR
2000
IEEE
15 years 10 months ago
2000
IEEE
Virtual environments have shown great promise as a research tool in science and engineering. In this paper we study a classical problem in mathematics: that of approximating globa...