16666 search results - page 37 / 3334 » Descriptive and Computational Complexity |
132
Voted
JC
2007
15 years 3 months ago
2007
We extend the lower bounds on the complexity of computing Betti numbers proved in [6] to complex algebraic varieties. More precisely, we first prove that the problem of deciding ...
151
Voted
LICS
2010
IEEE
15 years 1 months ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
175
click to vote
STOC
2012
ACM
13 years 5 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
132
Voted
MOBICOM
1999
ACM
15 years 7 months ago
1999
ACM
The concept augmented reality is used to describe a system that supplements reality by adding virtual objects into a real-world view. This paper describes a flexible mobile code a...
132
Voted
EXPCS
2007
15 years 7 months ago
2007
In this paper, we introduce EXACT, the EXperimental Algorithmics Computational Toolkit. EXACT is a software framework for describing, controlling, and analyzing computer experimen...