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

scientific article

From MaRDI portal
Publication:4035722
Jump to:navigation, search

zbMATH Open0789.68077MaRDI QIDQ4035722FDOQ4035722

Shang-Hua Teng

Publication date: 18 May 1993



Title of this publication is not available (Why is that?)


zbMATH Keywords

permutationsBoolean circuitscryptographycryptanalysiscircuit complexityVLSIcommunication topologiesring-protocolmulti-party communication complexityalgebraic circuits over finite ringsinversion circuitstree-protocol


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)



Cited In (1)

  • Functional inversion and communication complexity


   Recommendations
  • Functional inversion and communication complexity πŸ‘ πŸ‘Ž
  • Title not available (Why is that?) πŸ‘ πŸ‘Ž
  • Title not available (Why is that?) πŸ‘ πŸ‘Ž
  • Probabilistic communication complexity πŸ‘ πŸ‘Ž
  • On the circuit-size of inverses πŸ‘ πŸ‘Ž





This page was built for publication:

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

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