Pages that link to "Item:Q976085"

The following pages link to Faster multi-witnesses for Boolean matrix multiplication (Q976085):

Displaying 12 items.

• Quantum and approximation algorithms for maximum witnesses of Boolean matrix products (Q831754) (← links)
• Efficient algorithms for subgraph listing (Q1736617) (← links)
• A fast deterministic detection of small pattern graphs in graphs without large cliques (Q1740697) (← links)
• Extreme witnesses and their applications (Q1799232) (← links)
• Detecting and enumerating small induced subgraphs in \(c\)-closed graphs (Q2043376) (← links)
• A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques (Q2980911) (← links)
• Extreme Witnesses and Their Applications (Q3467863) (← links)
• (Q5002730) (← links)
• Finding Cliques in Social Networks: A New Distribution-Free Model (Q5112249) (← links)
• Bounds and algorithms for graph trusses (Q5119376) (← links)
• Rare siblings speed-up deterministic detection and counting of small pattern graphs (Q5925690) (← links)
• Quantum and approximation algorithms for maximum witnesses of Boolean matrix products (Q6629670) (← links)