3946 search results - page 13 / 790 » The computational complexity of choice sets |
DAC
1999
ACM
14 years 10 months ago
1999
ACM
Software synthesis from a concurrent functional specification is a key problem in the design of embedded systems. A concurrent specification is well-suited for medium-grained part...
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
The process of development creates a phenotype from one or more genotypes of an individual through interaction with an environment. The opportunity for development to choose a phe...
ATAL
2006
Springer
14 years 1 months ago
2006
Springer
We model social choice problems in which self interested agents with private utility functions have to agree on values for a set of variables subject to side constraints. The goal...
JC
2007
13 years 9 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 ...
APAL
2010
13 years 10 months ago
2010
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...