Results 1  10
of
743,098
Biimmunity separates strong NPcompleteness notions
 Information and Computation
, 2004
"... Abstract. We prove that if for some ɛ> 0, NP contains a set that is DTIME(2 nɛ)biimmune, then NP contains a set that is 2Turing complete for NP (hence 3truthtable complete) but not 1truthtable complete for NP. Thus this hypothesis implies a strong separation of completeness notions for NP. ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Abstract. We prove that if for some ɛ> 0, NP contains a set that is DTIME(2 nɛ)biimmune, then NP contains a set that is 2Turing complete for NP (hence 3truthtable complete) but not 1truthtable complete for NP. Thus this hypothesis implies a strong separation of completeness notions for NP
Partial Biimmunity and NPCompleteness
"... The Turing and manyone completeness notions for NP have been previously separated under measure, genericity, and biimmunity hypotheses on NP. The proofs of all these results rely on the existence of a language in NP with almost everywhere hardness. In this paper we separate the same NPcompletenes ..."
Abstract
 Add to MetaCart
The Turing and manyone completeness notions for NP have been previously separated under measure, genericity, and biimmunity hypotheses on NP. The proofs of all these results rely on the existence of a language in NP with almost everywhere hardness. In this paper we separate the same NPcompleteness
Partial Biimmunity, Scaled Dimension, and NPCompleteness
"... The Turing and manyone completeness notions for NP have been previously separated undermeasure, genericity, and biimmunity hypotheses on NP. The proofs of all these results rely on ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
The Turing and manyone completeness notions for NP have been previously separated undermeasure, genericity, and biimmunity hypotheses on NP. The proofs of all these results rely on
A Note on Genericity and BiImmunity
 In Proceedings of the Tenth Annual Structure in Complexity Theory Conference
, 1995
"... Generic sets have all properties (from among a suitably chosen class) that can be enforced by finite extension arguments. In particular, pgeneric sets are known to be Pbiimmune. We try to clarify the precise relationship between genericity and biimmunity by proposing an extended notion of biimm ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
Generic sets have all properties (from among a suitably chosen class) that can be enforced by finite extension arguments. In particular, pgeneric sets are known to be Pbiimmune. We try to clarify the precise relationship between genericity and biimmunity by proposing an extended notion of biimmunity
A Behavioral Notion of Subtyping
 ACM Transactions on Programming Languages and Systems
, 1994
"... The use of hierarchy is an important component of objectoriented design. Hierarchy allows the use of type families, in which higher level supertypes capture the behavior that all of their subtypes have in common. For this methodology to be effective, it is necessary to have a clear understanding of ..."
Abstract

Cited by 514 (18 self)
 Add to MetaCart
is easy for programmers to use. The subtype relation is based on the specifications of the sub and supertypes; the paper presents a way of specifying types that makes it convenient to define the subtype relation. The paper also discusses the ramifications of this notion of subtyping on the design of type
Separation of ownership and control
 JOURNAL OF LAW AND ECONOMICS
, 1983
"... This paper analyzes the survival of organizations in which decision agents do not bear a major share of the wealth effects of their decisions. This is what the literature on large corporations calls separation of âownershipâ and âcontrol.â Such separation of decision and risk bearing functio ..."
Abstract

Cited by 1564 (7 self)
 Add to MetaCart
This paper analyzes the survival of organizations in which decision agents do not bear a major share of the wealth effects of their decisions. This is what the literature on large corporations calls separation of âownershipâ and âcontrol.â Such separation of decision and risk bearing
Blind Signal Separation: Statistical Principles
, 2003
"... Blind signal separation (BSS) and independent component analysis (ICA) are emerging techniques of array processing and data analysis, aiming at recovering unobserved signals or `sources' from observed mixtures (typically, the output of an array of sensors), exploiting only the assumption of mut ..."
Abstract

Cited by 522 (4 self)
 Add to MetaCart
Blind signal separation (BSS) and independent component analysis (ICA) are emerging techniques of array processing and data analysis, aiming at recovering unobserved signals or `sources' from observed mixtures (typically, the output of an array of sensors), exploiting only the assumption
The separation of ownership and control in East Asian Corporations
 Journal of Financial Economics
, 2000
"... We examine the separation of ownership and control for 2,980 corporations in nine East Asian countries. In all countries, voting rights frequently exceed cash#ow rights via pyramid structures and crossholdings. The separation of ownership and control is most pronounced among familycontrolled &quo ..."
Abstract

Cited by 573 (17 self)
 Add to MetaCart
We examine the separation of ownership and control for 2,980 corporations in nine East Asian countries. In all countries, voting rights frequently exceed cash#ow rights via pyramid structures and crossholdings. The separation of ownership and control is most pronounced among family
Where the REALLY Hard Problems Are
 IN J. MYLOPOULOS AND R. REITER (EDS.), PROCEEDINGS OF 12TH INTERNATIONAL JOINT CONFERENCE ON AI (IJCAI91),VOLUME 1
, 1991
"... It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard p ..."
Abstract

Cited by 681 (1 self)
 Add to MetaCart
It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard
Biimmunity Results for Cheatable Sets
 Theoretical Computer Science
, 1995
"... An oracle A is kcheatable if there is a polynomialtime algorithm to determine the answers to 2 k parallel queries to A from the answers to only k queries to some other oracle B. It is known that 1cheatable sets cannot be biimmune for P. In contrast, we construct 2cheatable sets that are biim ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
for arbitrary time complexity classes. In addition, for each k, we construct a set that is (k + 1)cheatable, but not kcheatable; we show that this separation does not hold with biimmunity. We show that if a recursive set A is biimmune for P then there exists an infinite 1cheatable set that is polynomial
Results 1  10
of
743,098