1615 search results - page 41 / 323 » Computer science and decision theory |
SOFSEM
2009
Springer
14 years 4 months ago
2009
Springer
Informationen zum TheorieTag und Abstracts zu den Beitr¨agen finden Sie unter http://www.uni-ulm.de/in/theo/tt56.html.
FOCS
1998
IEEE
13 years 12 months ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
CAD
2007
Springer
13 years 7 months ago
2007
Springer
Defeaturing is a popular CAD/ CAE simplification technique where ‘small or irrelevant features’ are suppressed within a CAD model for speeding-up downstream processes, especia...
MFCS
2001
Springer
14 years 2 days ago
2001
Springer
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview...
LICS
1999
IEEE
13 years 12 months ago
1999
IEEE
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic lo...