Results 1  10
of
1,628,679
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
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
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 NP
Monotone Complexity
, 1990
"... We give a general complexity classification scheme for monotone computation, including monotone spacebounded and Turing machine models not previously considered. We propose monotone complexity classes including mAC i , mNC i , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We define a simple ..."
Abstract

Cited by 2837 (11 self)
 Add to MetaCart
We give a general complexity classification scheme for monotone computation, including monotone spacebounded and Turing machine models not previously considered. We propose monotone complexity classes including mAC i , mNC i , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We define a
DIAGONALLY NONCOMPUTABLE FUNCTIONS AND BIIMMUNITY
"... Abstract. We prove that every diagonally noncomputable function computes a set A which is biimmune, meaning that neither A nor its complement has an infinite computably enumerable subset. 1. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We prove that every diagonally noncomputable function computes a set A which is biimmune, meaning that neither A nor its complement has an infinite computably enumerable subset. 1.
Parameterized Complexity
, 1998
"... the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs ..."
Abstract

Cited by 1218 (75 self)
 Add to MetaCart
the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs
Quantum complexity theory
 in Proc. 25th Annual ACM Symposium on Theory of Computing, ACM
, 1993
"... Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97–117]. This constructi ..."
Abstract

Cited by 582 (5 self)
 Add to MetaCart
the modern (complexity theoretic) formulation of the Church–Turing thesis. We show the existence of a problem, relative to an oracle, that can be solved in polynomial time on a quantum Turing machine, but requires superpolynomial time on a boundederror probabilistic Turing machine, and thus not in the class
A standardized set of 260 pictures: Norms for name agreement, image agreement, familiarity, and visual complexity
 JOURNAL OF EXPERIMENTAL PSYCHOLOGY: HUMAN LEARNING AND MEMORY
, 1980
"... In this article we present a standardized set of 260 pictures for use in experiments investigating differences and similarities in the processing of pictures and words. The pictures are blackandwhite line drawings executed according to a set of rules that provide consistency of pictorial represent ..."
Abstract

Cited by 615 (1 self)
 Add to MetaCart
attributes of the pictures. The concepts were selected to provide exemplars from several widely studied semantic categories. Sources of naming variance, and mean familiarity and complexity of the exemplars, differed significantly across the set of categories investigated. The potential significance of each
Statistical mechanics of complex networks
 Rev. Mod. Phys
"... Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled as ra ..."
Abstract

Cited by 2083 (10 self)
 Add to MetaCart
Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled
The 2005 pascal visual object classes challenge
, 2006
"... Abstract. The PASCAL Visual Object Classes Challenge ran from February to March 2005. The goal of the challenge was to recognize objects from a number of visual object classes in realistic scenes (i.e. not presegmented objects). Four object classes were selected: motorbikes, bicycles, cars and peop ..."
Abstract

Cited by 633 (24 self)
 Add to MetaCart
Abstract. The PASCAL Visual Object Classes Challenge ran from February to March 2005. The goal of the challenge was to recognize objects from a number of visual object classes in realistic scenes (i.e. not presegmented objects). Four object classes were selected: motorbikes, bicycles, cars
Results 1  10
of
1,628,679