Technical Reports on Mathematical and Computing Sciences: TR-C168
نویسندگان
چکیده
For relativized arguments, we propose to restrict oracle queries to “stringent” ones; for comparing the power of two machine models relative to some oracle set, stringent relativization is to restrict machines of both types to ask queries on the same segment of the oracle. In particular, for investigating polynomial-time (or polynomial-size) computability, we propose polynomial stringency, bounding query length to any fixed polynomial of input length. Under such stringent oracle access, we show an oracle G such that BPP = PH.
منابع مشابه
Technical Reports on Mathematical and Computing Sciences: TR-C184
Based on a variation of the pigeon hole principle, we propose a propositional formula having a unique satisfying assignment and prove an exponential lower bound for computing each bit of its satisfying by the tree-like resolution. Our proof is obtained by following the outline proposed by Ben-Sasson and Wigderson [BW99].
متن کاملTechnical Reports on Mathematical and Computing Sciences: TR-CXXX title: Algorithmic Aspects of Boosting
We discuss algorithmic aspects of boosting techniques, such as Majority Vote Boosting [Fre95], AdaBoost [FS97], and MadaBoost [DW00a]. Considering a situation where we are given a huge amount of examples and asked to find some rule for explaining these example data, we show some reasonable algorithmic approaches for dealing with such a huge dataset by boosting techniques. Through this example, ...
متن کاملTechnical Reports on Mathematical and Computing Sciences : TR - C 209 title : Hausdorff Dimension and the Stochastic Traveling Salesman Problem
The traveling salesman problem is a problem of finding the shortest tour through given points. In 1959, Beardwood, Halton, and Hammersley studied asymptotic length of the shortest tour through points on Euclidean space. In particular they described the optimal tour length with Euclidean dimension for the case that points are distributed with respect to Lebesgue absolutely continuous measure. In...
متن کاملTechnical Reports on Mathematical and Computing Sciences: Tr-c124 Title: a Role of Constraint in Self-organization Authors
In this paper we introduce a neural network model of self-organization. This model uses a variation of Hebb rule for updating its synaptic weights, and surely converges to the equilibrium status. The key point of the convergence is the update rule that constrains the total synaptic weight and this seems to make the model stable. We investigate the role of the constraint and show that it is the ...
متن کاملTechnical Reports on Mathematical and Computing Sciences: Tr-c136 Title: Adaptive Sampling Methods for Scaling up Knowledge Discovery Algorithms (extended Revised Version of Tr-c131)
Scalability is a key requirement for any KDD and data mining algorithm, and one of the biggest research challenges is to develop methods that allow to use large amounts of data. One possible approach for dealing with huge amounts of data is to take a random sample and do data mining on it, since for many data mining applications approximate answers are acceptable. However, as argued by several ...
متن کامل