FAQ

Aanderaa–Karp–Rosenberg conjecture

Known as: Evasiveness, Evasiveness conjecture, Aanderaa–Rosenberg conjecture 
In theoretical computer science, the Aanderaa–Karp–Rosenberg conjecture (also known as the Aanderaa–Rosenberg conjecture or the evasiveness… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1975-2018
01219752018

Related topics

Related topics

26 relations
AlgorithmClique problemCombinatoricaDeterministic algorithm
(More)

Broader (2)

Computational complexity theoryGraph theory

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Aanderaa–Karp–Rosenberg conjecture
Algorithm
Computational complexity theory
Planar graph
Randomized algorithm
Graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
The smallest nonevasive graph property
A property of n-vertex graphs is called evasive if every algorithm testing this property by asking questions of the form “is… (More)
  • figure 1
Is this relevant?
2013
2013
Evasiveness through a circuit lens
A function f : {0, 1}<sup>n</sup> -&gt; {0, 1} is called <i>evasive</i> if its decision tree complexity is maximal, i.e., D(f… (More)
Is this relevant?
2012
2012
Strong Homotopy Types, Nerves and Collapses
We introduce the theory of strong homotopy types of simplicial complexes. Similarly to classical simple homotopy theory, the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Review
2010
Review
2010
Perspectives in High Dimensions Schedule
s David Alonso-Gutiérrez On a different proof of Junge’s estimate for the isotropy constant of polytopes Tuesday 4:30–4:55 p.m… (More)
Is this relevant?
2009
2009
ar X iv : 0 90 7 . 29 54 v 1 [ m at h . G T ] 1 6 Ju l 2 00 9 STRONG HOMOTOPY TYPES , NERVES AND COLLAPSES
We introduce the theory of strong homotopy types of simplicial complexes. Similarly to classical simple homotopy theory, the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2002
2002
Lecture Notes on Evasiveness of Graph Properties
These notes cover the first eight lectures of the class Many Models of Complexity taught by László Lovász at Princeton University… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2001
2001
Some Results Related to the Evasiveness Conjecture
 
Is this relevant?
Review
2000
Review
2000
Morse Theory and Evasiveness
x0. Introduction. Consider a game played by 2 players, whom we call the hider and the seeker. Let S be a simplex of dimension n… (More)
Is this relevant?
1980
1980
Further results on the Aanderaa-Rosenberg conjecture
 
Is this relevant?
1975
1975
A Generalization and Proof of the Aanderaa-Rosenberg Conjecture
<italic>We investigate the maximum number</italic> C(P) <italic>of arguments of</italic> P <italic>that must be tested in order… (More)
Is this relevant?