15033 search results - page 248 / 3007 » Complexity Theory and Algorithms |
131
Voted
IJAC
2002
15 years 4 months ago
2002
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...
182
click to vote
CHI
2011
ACM
14 years 8 months ago
2011
ACM
The study of creativity has received significant attention over the past century, with a recent increase in interest in collaborative, distributed creativity. We posit that creati...
151
click to vote
JAR
2006
15 years 4 months ago
2006
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
138
click to vote
COCO
2000
Springer
15 years 8 months ago
2000
Springer
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...
152
click to vote
COCO
2001
Springer
15 years 9 months ago
2001
Springer
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...