The following pages link to (Q4133137):
Displaying 12 items.
- Testing whether a digraph contains \(H\)-free \(k\)-induced subgraphs (Q955032) (← links)
- A topological approach to evasiveness (Q1065831) (← links)
- Some results on the complexity of families of sets (Q1176725) (← links)
- An \(\Omega{} (n^{4/3})\) lower bound on the randomized complexity of graph properties (Q1180414) (← links)
- Further results on the Aanderaa-Rosenberg conjecture (Q1237992) (← links)
- Packings of graphs and applications to computational complexity (Q1250227) (← links)
- The Rivest-Vuillemin conjecture on monotone Boolean functions is true for ten variables (Q1578507) (← links)
- Nontrivial monotone weakly symmetric Boolean functions with six variables are elusive (Q1960414) (← links)
- Using Brouwer’s Fixed Point Theorem (Q4604376) (← links)
- (Q5009608) (← links)
- Bipartite perfect matching as a real polynomial (Q6065237) (← links)
- Elusive properties of infinite graphs (Q6144919) (← links)
