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

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

- Michal Adamaszek
- Discussiones Mathematicae Graph Theory
- 2014

A property of n-vertex graphs is called evasive if every algorithm testing this property by asking questions of the form “is… (More)

Is this relevant?

2013

2013

- Raghav Kulkarni
- ITCS
- 2013

A function f : {0, 1}<sup>n</sup> -> {0, 1} is called <i>evasive</i> if its decision tree complexity is maximal, i.e., D(f… (More)

Is this relevant?

2012

2012

- Jonathan Ariel Barmak, Elias Gabriel Minian
- Discrete & Computational Geometry
- 2012

We introduce the theory of strong homotopy types of simplicial complexes. Similarly to classical simple homotopy theory, the… (More)

Is this relevant?

Review

2010

Review

2010

- Michael D Dore
- 2010

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

We introduce the theory of strong homotopy types of simplicial complexes. Similarly to classical simple homotopy theory, the… (More)

Is this relevant?

2002

2002

- László Lovász, Neal E. Young
- ArXiv
- 2002

These notes cover the first eight lectures of the class Many Models of Complexity taught by László Lovász at Princeton University… (More)

Is this relevant?

2001

Review

2000

Review

2000

- Robin Forman
- Combinatorica
- 2000

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

1975

1975

- Ronald L. Rivest, Jean Vuillemin
- STOC
- 1975

<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?