Results 1  10
of
27
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 14 (1 self)
 Add to MetaCart
(Show Context)
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
Canonical Disjoint NPPairs of Propositional Proof Systems
 ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY, REPORT NO. 106
, 2004
"... We prove that every disjoint NPpair is polynomialtime, manyone equivalent to the canonical disjoint NPpair of some propositional proof system. Therefore, the degree structure of the class of disjoint NPpairs and of all canonical pairs is identical. Secondly, we show that this degree structure i ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
(Show Context)
We prove that every disjoint NPpair is polynomialtime, manyone equivalent to the canonical disjoint NPpair of some propositional proof system. Therefore, the degree structure of the class of disjoint NPpairs and of all canonical pairs is identical. Secondly, we show that this degree structure is not superficial: Assuming there exist Pinseparable disjoint pairs, there exist intermediate disjoint NPpairs. That is, if (A, B) is a Pseparable disjoint NPpair and (C, D) is a Pinseparable disjoint NPpair, then there exist Pinseparable, incomparable NPpairs (E, F) and (G, H) whose degrees lie strictly between (A, B) and (C, D). Furthermore, between any two disjoint NPpairs that are comparable and inequivalent, such a diamond exists.
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 9 (0 self)
 Add to MetaCart
(Show Context)
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 7 (4 self)
 Add to MetaCart
(Show Context)
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
Computational complexity of selecting components for composition
 In Proceedings of the Fall 2003 Simulation Interoperability Workshop
, 2003
"... ABSTRACT: Composability is the capability to select and assemble simulation components in various combinations into simulation systems to satisfy specific user requirements. The defining characteristic of composability is the ability to combine and recombine components. Composability exists in two f ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
ABSTRACT: Composability is the capability to select and assemble simulation components in various combinations into simulation systems to satisfy specific user requirements. The defining characteristic of composability is the ability to combine and recombine components. Composability exists in two forms, syntactic and semantic (also known as engineering and modeling). Syntactic composability is the implementation of components so that they can be connected. Semantic composability is the question of whether the models implemented in the composed components can be meaningfully composed, i.e., is their combined computation valid? A theory of semantic composability has been developed that examines the semantic composability of models using formal definitions and reasoning. The computational complexity of the problem of selecting a set of components that meet a set of objectives is examined. In earlier work, Page and Opper defined four variants of this component selection problem based on two forms of objectives decidability (bounded and unbounded) and two forms of composition (emergent and nonemergent). They gave a proof that the bounded nonemergent variant of the component selection problem is NPcomplete. In this paper an additional form of composition (antiemergent) is defined, leading to two additional variants of the problem. Then a general form of the component selection problem that subsumes all six variants is defined. The general component selection problem is proven to be NPcomplete even if the objectives met by a component or composition are known. Several related but different problems, including determining the objectives met by a component and determining the validity of a proposed composition are defined, and conjectures for their complexity are given. 1.
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 5 (0 self)
 Add to MetaCart
(Show Context)
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 ..."
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 3 (0 self)
 Add to MetaCart
(Show Context)
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.