Results 1  10
of
15
Aggregating disparate estimates of chance
, 2004
"... We consider a panel of experts asked to assign probabilities to events, both logically simple and complex. The events evaluated by different experts are based on overlapping sets of variables but may otherwise be distinct. The union of all the judgments will likely be probabilistic incoherent. We ad ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
We consider a panel of experts asked to assign probabilities to events, both logically simple and complex. The events evaluated by different experts are based on overlapping sets of variables but may otherwise be distinct. The union of all the judgments will likely be probabilistic incoherent. We address the problem of revising the probability estimates of the panel so as to produce a coherent set that best represents the group’s expertise.
A Short History of Computational Complexity
 IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY
, 2002
"... this article mention all of the amazing research in computational complexity theory. We survey various areas in complexity choosing papers more for their historical value than necessarily the importance of the results. We hope that this gives an insight into the richness and depth of this still quit ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
this article mention all of the amazing research in computational complexity theory. We survey various areas in complexity choosing papers more for their historical value than necessarily the importance of the results. We hope that this gives an insight into the richness and depth of this still quite young eld
Algorithm Selection for Sorting and Probabilistic Inference: A Machine LearningBased Approach
 KANSAS STATE UNIVERSITY
, 2003
"... The algorithm selection problem aims at selecting the best algorithm for a given computational problem instance according to some characteristics of the instance. In this dissertation, we first introduce some results from theoretical investigation of the algorithm selection problem. We show, by Rice ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
The algorithm selection problem aims at selecting the best algorithm for a given computational problem instance according to some characteristics of the instance. In this dissertation, we first introduce some results from theoretical investigation of the algorithm selection problem. We show, by Rice's theorem, the nonexistence of an automatic algorithm selection program based only on the description of the input instance and the competing algorithms. We also describe an abstract theoretical framework of instance hardness and algorithm performance based on Kolmogorov complexity to show that algorithm selection for search is also incomputable. Driven by the theoretical results, we propose a machine learningbased inductive approach using experimental algorithmic methods and machine learning techniques to solve the algorithm selection problem. Experimentally, we have
Autoreducibility, mitoticity and immunity
 Mathematical Foundations of Computer Science: Thirtieth International Symposium, MFCS 2005
, 2005
"... We show the following results regarding complete sets. • NPcomplete sets and PSPACEcomplete sets are manyone autoreducible. • Complete sets of any level of PH, MODPH, or the Boolean hierarchy over NP are manyone autoreducible. • EXPcomplete sets are manyone mitotic. • NEXPcomplete sets are we ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
We show the following results regarding complete sets. • NPcomplete sets and PSPACEcomplete sets are manyone autoreducible. • Complete sets of any level of PH, MODPH, or the Boolean hierarchy over NP are manyone autoreducible. • EXPcomplete sets are manyone mitotic. • NEXPcomplete sets are weakly manyone mitotic. • PSPACEcomplete sets are weakly Turingmitotic. • If oneway permutations and quick pseudorandom generators exist, then NPcomplete languages are mmitotic. • If there is a tally language in NP ∩ coNP − P, then, for every ɛ> 0, NPcomplete sets are not 2 n(1+ɛ)immune. These results solve several of the open questions raised by Buhrman and Torenvliet in their 1994 survey paper on the structure of complete sets. 1
Polylogarithmicround Interactive Proofs for coNP Collapse the Exponential Hierarchy
, 2006
"... If every language in coNP has constant round interactive proof system, then the polynomialtime hierarchy collapses [BHZ87]. On the other hand, the wellknown LFKN protocol gives O(n)round interactive proof systems for all languages in coNP [LFKN92]. We consider the question whether it is possible f ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
If every language in coNP has constant round interactive proof system, then the polynomialtime hierarchy collapses [BHZ87]. On the other hand, the wellknown LFKN protocol gives O(n)round interactive proof systems for all languages in coNP [LFKN92]. We consider the question whether it is possible for coNP to have interactive proof systems with polylogarithmic round complexity. We show that this is unlikely by proving that if a coNPcomplete set has a polylogarithmicround interactive proof system then the exponentialtime hierarchy collapses. We also consider exponential versions of the KarpLipton theorem and Yap’s theorem.
Kolmogorov complexity and computational complexity
 Complexity of Computations and Proofs. Quaderni di Matematica
, 2004
"... We describe the properties of various notions of timebounded Kolmogorov complexity and other connections between Kolmogorov complexity and computational complexity. 1 ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We describe the properties of various notions of timebounded Kolmogorov complexity and other connections between Kolmogorov complexity and computational complexity. 1
Aggregating probabilistic forecasts from incoherent and abstaining experts. Decision Anal
, 2008
"... doi 10.1287/deca.1080.0119 ..."
A Bayesian Approach for Automatic Algorithm Selection
"... This paper introduces a selftraining automatic algorithm selection system based on experimental methods and probabilistic learning and reasoning techniques. The system aims to select the most appropriate algorithm according to the characteristics of the input problem instance. The general meth ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper introduces a selftraining automatic algorithm selection system based on experimental methods and probabilistic learning and reasoning techniques. The system aims to select the most appropriate algorithm according to the characteristics of the input problem instance. The general methodology is described, the system framework is presented, and key research problems are identified.
AverageCase Complexity Theory and PolynomialTime Reductions
, 2001
"... This thesis studies averagecase complexity theory and polynomialtime reducibilities. The issues in averagecase complexity arise primarily from Cai and Selman's extension of Levin's denition of average polynomial time. We study polynomialtime reductions between distributional problems. Under stro ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This thesis studies averagecase complexity theory and polynomialtime reducibilities. The issues in averagecase complexity arise primarily from Cai and Selman's extension of Levin's denition of average polynomial time. We study polynomialtime reductions between distributional problems. Under strong but reasonable hypotheses we separate ordinary NPcompleteness notions.
Polylogarithmicround interactive proofs for coNP collapse the exponential hierarchy
, 2004
"... It is known [BHZ87] that if every language in coNP has a constantround interactive proof system, then the polynomial hierarchy collapses. On the other hand, Lund et al. [LFKN92] have shown that #SAT, the #Pcomplete function that outputs the number of satisfying assignments of a Boolean formula, c ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
It is known [BHZ87] that if every language in coNP has a constantround interactive proof system, then the polynomial hierarchy collapses. On the other hand, Lund et al. [LFKN92] have shown that #SAT, the #Pcomplete function that outputs the number of satisfying assignments of a Boolean formula, can be computed by a linearround interactive protocol. As a consequence, the coNPcomplete set SAT has a proof system with linear rounds of interaction. We show that if every set in coNP has a polylogarithmicround interactive protocol then the exponential hierarchy collapses to the third level. In order to prove this, we obtain an exponential version of Yap’s result [Yap83], and improve upon an exponential version of the KarpLipton theorem [KL80], obtained first by Buhrman and Homer [BH92].