Pages that link to "Item:Q1238421"
From MaRDI portal
The following pages link to On recognizing graph properties from adjacency matrices (Q1238421):
Displaying 50 items.
- Totally optimal decision trees for Boolean functions (Q323025) (← links)
- Properties of complexity measures for PRAMs and WRAMs (Q580980) (← links)
- A class of algorithms which require nonlinear time to maintain disjoint sets (Q598809) (← links)
- An asymptotic bound for the complexity of monotone graph properties (Q653841) (← links)
- Block sensitivity of minterm-transitive functions (Q719324) (← links)
- Counting induced subgraphs: a topological approach to \#W[1]-hardness (Q786040) (← links)
- The critical complexity of graph properties (Q795503) (← links)
- Lower bounds to randomized algorithms for graph properties (Q808708) (← links)
- A lower bound for the recognition of digraph properties (Q810043) (← links)
- Counting induced subgraphs: an algebraic approach to \(\#\)W[1]-hardness (Q832520) (← links)
- Discovery of network properties with all-shortest-paths queries (Q962167) (← links)
- A note on the query complexity of the Condorcet winner problem (Q975500) (← links)
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
- A topological approach to evasiveness (Q1065831) (← links)
- On lattices with Möbius function \(\pm 1,0\) (Q1087570) (← links)
- A fast algorithm for translating combinator expressions with BC-chains (Q1096387) (← links)
- Discrete extremal problems (Q1152306) (← links)
- An \(\Omega{} (n^{5/4})\) lower bound on the randomized complexity of graph properties (Q1180407) (← links)
- On computing majority by comparisons (Q1181015) (← links)
- On read-once threshold formulae and their randomized decision tree complexity (Q1208407) (← links)
- Further results on the Aanderaa-Rosenberg conjecture (Q1237992) (← links)
- Communication complexity and combinatorial lattice theory (Q1309387) (← links)
- Exact lower time bounds for computing Boolean functions on CREW PRAMs (Q1329159) (← links)
- The Rivest-Vuillemin conjecture on monotone Boolean functions is true for ten variables (Q1578507) (← 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)
- On the recognition complexity of some graph properties (Q1924495) (← links)
- Nontrivial monotone weakly symmetric Boolean functions with six variables are elusive (Q1960414) (← links)
- Delta invariant for Eulerian digraphs (Q2079872) (← links)
- Generalized adjacency and Laplacian spectra of the weighted corona graphs (Q2161928) (← links)
- A hierarchy of dismantlings in graphs (Q2185916) (← links)
- Elusiveness of finding degrees (Q2201777) (← links)
- Adaptive majority problems for restricted query graphs and for weighted sets (Q2208365) (← links)
- Any monotone property of 3-uniform hypergraphs is weakly evasive (Q2348256) (← links)
- Block sensitivity of weakly symmetric functions (Q2382286) (← links)
- Elusiveness of Finding Degrees (Q2971652) (← links)
- Discovery of Network Properties with All-Shortest-Paths Queries (Q3511392) (← links)
- Transitive q-Ary Functions over Finite Fields or Finite Sets: Counts, Properties and Applications (Q3519549) (← links)
- The computational complexity of matroid properties (Q3873544) (← links)
- Using Brouwer’s Fixed Point Theorem (Q4604376) (← links)
- (Q5009487) (← links)
- (Q5043125) (← links)
- (Q5092385) (← links)
- Tight bounds for finding degrees from the adjacency matrix (Q5096323) (← links)
- Separation Between Deterministic and Randomized Query Complexity (Q5376437) (← links)
- On the relationship between energy complexity and other Boolean function measures (Q5918744) (← links)
- On the elusiveness of Hamiltonian property (Q5931908) (← links)
- Query complexity of tournament solutions (Q6122601) (← links)
- Adaptive majority problems for restricted query graphs and for weighted sets (Q6621188) (← links)
