Pages that link to "Item:Q1065831"

The following pages link to A topological approach to evasiveness (Q1065831):

Displaying 50 items.

• Knots in collapsible and non-collapsible balls (Q396852) (← links)
• The smallest nonevasive graph property (Q472145) (← links)
• One-point suspensions and wreath products of polytopes and spheres (Q556855) (← links)
• An asymptotic bound for the complexity of monotone graph properties (Q653841) (← links)
• Strong homotopy types, nerves and collapses (Q664351) (← links)
• Counting induced subgraphs: a topological approach to \#W[1]-hardness (Q786040) (← links)
• A combinatorial technique for simplicial complexes and some applications to finite groups (Q803276) (← links)
• A lower bound for the recognition of digraph properties (Q810043) (← links)
• Counting induced subgraphs: an algebraic approach to \(\#\)W[1]-hardness (Q832520) (← links)
• A generalization of a result of Dong and Santos-Sturmfels on the Alexander dual of spheres and balls (Q891830) (← links)
• Topological invariants of classification problems (Q908698) (← links)
• Complexes of graphs with bounded matching size (Q925308) (← links)
• A note on the query complexity of the Condorcet winner problem (Q975500) (← links)
• Simplicial simple-homotopy of flag complexes in terms of graphs (Q1041193) (← links)
• On lattices with Möbius function \(\pm 1,0\) (Q1087570) (← links)
• Homotopy properties of greedoids (Q1101115) (← links)
• An \(\Omega{} (n^{5/4})\) lower bound on the randomized complexity of graph properties (Q1180407) (← links)
• An \(\Omega{} (n^{4/3})\) lower bound on the randomized complexity of graph properties (Q1180414) (← links)
• The Rivest-Vuillemin conjecture on monotone Boolean functions is true for ten variables (Q1578507) (← links)
• Decision tree complexity of graph properties with dimension at most 5 (Q1587333) (← links)
• Subdivisions, Shellability, and collapsibility of products (Q1705798) (← links)
• Coxeter groups and nonuniform complexity (Q1814266) (← links)
• Constructions preserving evasiveness and collapsibility (Q1817576) (← links)
• A generalized model for understanding evasiveness (Q1825645) (← links)
• Some results related to the evasiveness conjecture. (Q1850513) (← links)
• Complexity measures and decision tree complexity: a survey. (Q1853508) (← links)
• Topology of bounded-degree graph complexes. (Q1873800) (← links)
• On the recognition complexity of some graph properties (Q1924495) (← links)
• Nontrivial monotone weakly symmetric Boolean functions with six variables are elusive (Q1960414) (← links)
• The worst way to collapse a simplex (Q2055286) (← links)
• Fixed points of group actions on link collapsible simplicial complexes (Q2068606) (← links)
• Collapsibility of CAT(0) spaces (Q2181578) (← links)
• A hierarchy of dismantlings in graphs (Q2185916) (← links)
• Barycentric subdivisions of convex complexes are collapsible (Q2207589) (← links)
• Cooperative games on simplicial complexes (Q2208366) (← links)
• Any monotone property of 3-uniform hypergraphs is weakly evasive (Q2348256) (← links)
• Linear colorings of simplicial complexes and collapsing (Q2384574) (← links)
• Collapsing along monotone poset maps (Q2468979) (← links)
• The topology of the independence complex (Q2493109) (← links)
• Order complexes of coset posets of finite groups are not contractible. (Q2634794) (← links)
• Evasiveness of graph properties and topological fixed-point theorems (Q2872493) (← links)
• Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas (Q3007625) (← links)
• Evasiveness and the Distribution of Prime Numbers (Q3113738) (← links)
• Continuous single valued strategiesin evasion problems (Q3378137) (← links)
• Some Results on Elusive Graph Properties (Q4291554) (← links)
• Using Brouwer’s Fixed Point Theorem (Q4604376) (← links)
• (Q5043125) (← links)
• Counting Small Induced Subgraphs Satisfying Monotone Properties (Q5071087) (← links)
• (Q5092385) (← links)
• The complexity of graph connectivity (Q5096823) (← links)