2661 search results - page 114 / 533 » Quantum Complexity Classes |
168
click to vote
HYBRID
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. We define a new class of hybrid automata for which reachability is decidable--a proper superclass of the initialized rectangular hybrid automata--by taking parallel compo...
110
Voted
FSTTCS
1994
Springer
15 years 6 months ago
1994
Springer
We give an interactive protocol for s-t RELIABILITY, the well known reliability problem on graphs. Our protocol shows that if IP(f(n)) denotes the class of languages whose interac...
117
click to vote
COCOON
2008
Springer
15 years 5 months ago
2008
Springer
We analyze the complexity of equilibria problems for a class of strategic zero-sum games, called Angel-Daemon games. Those games were introduced to asses the goodness of a web or g...
136
click to vote
DAGSTUHL
2006
15 years 4 months ago
2006
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
121
click to vote
AAAI
2000
15 years 4 months ago
2000
We analyze the complexity of propositional kernel resolution (del Val 1999), a general method for obtaining logical consequences in restricted target languages. Different choices ...