scientific article; zbMATH DE number 503190
From MaRDI portal
Publication:4279511
zbMath0801.68088MaRDI QIDQ4279511
Michael R. Fellows, Neal Koblitz
Publication date: 17 February 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
cryptographyrandomized algorithmparameterized computational complexitydiscrete logarithmselliptic curve factorization
Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Elliptic curves (14H52)
Related Items (19)
Tennis manipulation: can we help Serena Williams win another tournament? Or can we control a knockout tournament with reasonable complexity? ⋮ Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(\) and PSPACE analogues] ⋮ The Birth and Early Years of Parameterized Complexity ⋮ Crypto Galore! ⋮ FPT Suspects and Tough Customers: Open Problems of Downey and Fellows ⋮ \(W[2\)-hardness of precedence constrained \(K\)-processor scheduling] ⋮ Parameterized circuit complexity and the \(W\) hierarchy ⋮ Change-making problems revisited: a parameterized point of view ⋮ A heuristic technique for decomposing multisets of non-negative integers according to the Minkowski sum ⋮ Scheduling and fixed-parameter tractability ⋮ Parameterized random complexity ⋮ Parameterized Learnability of k-Juntas and Related Problems ⋮ Fixed-parameter algorithms for unsplittable flow cover ⋮ Advice classes of parametrized tractability ⋮ Parameterizing by the number of numbers ⋮ On explaining integer vectors by few homogeneous segments ⋮ Threshold dominating sets and an improved characterization of \(W[2\)] ⋮ Parameterized learnability of juntas ⋮ Unnamed Item
This page was built for publication:
