Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

A nearly-optimal transfixing set

From MaRDI portal
Jump to:navigation, search

zbMATH Open0882.68066MaRDI QIDQ1363972FDOQ1363972

Alexander E. Andreev

Publication date: 11 March 1998

Published in: Doklady Mathematics (Search for Journal in Brave)




zbMATH Keywords

probabilistic algorithms


Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)




   Recommendations
  • Title not available (Why is that?) πŸ‘ πŸ‘Ž
  • On the complexity of asymptotically optimal coverings and packings πŸ‘ πŸ‘Ž
  • Title not available (Why is that?) πŸ‘ πŸ‘Ž
  • Efficient constructions of Hitting Sets for systems of linear functions πŸ‘ πŸ‘Ž
  • Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions πŸ‘ πŸ‘Ž





This page was built for publication: A nearly-optimal transfixing set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363972)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1363972&oldid=13512005"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 15:00. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki