Sufficient Conditions for Intractability Over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-89255-7_30
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Calculating Lower Bounds for Caching Problems

Computing (Vienna/New York)
Numerical AnalysisComputational TheoryComputer Science ApplicationsComputational MathematicsMathematicsTheoretical Computer ScienceSoftware
2007English

Sufficient Conditions for the Generalized Problem of Bolza

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1983English

Black Box Multigrid Solver for Definite and Indefinite Problems

1997English

Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Tight RMR Lower Bounds for Mutual Exclusion and Other Problems

2008English

Two Necessary and Sufficient Conditions for the Extension of Möbius Groups

Bulletin of the Australian Mathematical Society
Mathematics
2005English

Quantum Lower Bounds for the Collision and the Element Distinctness Problems

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
2004English

Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width

SIAM Journal on Computing
MathematicsComputer Science
2014English

Improved Lower Bounds for Tree-Like Resolution Over Linear Inequalities

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy