Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • Publication Date of Publication Type Tight adaptive reprogramming in the QROM 2023-05-12 Paper QMA-Hardness of Consistency of Local Density Matrices with...
    10 bytes (18 words) - 03:45, 13 December 2023
  • Publication Date of Publication Type A lower bound for proving hardness of learning with rounding with polynomial modulus 2024-02-06 Paper https://portal...
    10 bytes (16 words) - 20:53, 24 September 2023
  • Geometrization of \(N\)-extended 1-dimensional supersymmetry algebras. I. 2016-06-09 Paper Hardness of learning problems over Burnside groups of exponent 3...
    10 bytes (18 words) - 22:01, 10 December 2023
  • Publication Date of Publication Type Key rotation for authenticated encryption 2017-10-27 Paper On the concrete hardness of learning with errors 2015-10-13...
    10 bytes (16 words) - 08:33, 7 October 2023
  • Publication Date of Publication Type Hardness of learning problems over Burnside groups of exponent 3 2015-03-30 Paper Broadcast Steganography 2014-03-28...
    10 bytes (19 words) - 19:15, 6 October 2023
  • Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs 2011-08-17 Paper On the hardness of learning intersections of two halfspaces...
    10 bytes (16 words) - 05:32, 7 October 2023
  • Paper On the concrete hardness of learning with errors 2015-10-13 Paper...
    10 bytes (16 words) - 08:33, 7 October 2023
  • https://portal.mardi4nfdi.de/entity/Q5005160 2021-08-04 Paper Quantum Hardness of Learning Shallow Classical Circuits 2021-06-22 Paper Linear-Time Algorithm...
    10 bytes (16 words) - 18:16, 24 September 2023
  • CSPs 2023-12-08 Paper Hardness of learning DNFs using halfspaces 2023-11-14 Paper https://portal.mardi4nfdi.de/entity/Q5875482 2023-02-03 Paper https://portal...
    10 bytes (16 words) - 09:44, 7 October 2023
  • 2008-11-27 Paper Optimal Cryptographic Hardness of Learning Monotone Functions 2008-08-28 Paper Efficiently Testing Sparse GF(2) Polynomials 2008-08-28...
    10 bytes (18 words) - 10:59, 24 September 2023
  • to solve approx-SVP in ideal lattices 2023-03-21 Paper On the hardness of module learning with errors with short distributions 2023-01-05 Paper Post-quantum...
    10 bytes (18 words) - 12:50, 6 October 2023
  • NonInteractive Two-Party Protocols 2016-02-19 Paper Hardness of learning problems over Burnside groups of exponent 3 2015-03-30 Paper Translation-Randomizable...
    10 bytes (19 words) - 03:55, 25 September 2023
  • 2015-09-04 Paper Hardness of learning problems over Burnside groups of exponent 3 2015-03-30 Paper Broadcast Steganography 2014-03-28 Paper Hard-Core Predicates...
    10 bytes (16 words) - 16:30, 24 September 2023
  • the average case 2009-03-31 Paper Learning Random Monotone DNF 2008-11-27 Paper Optimal Cryptographic Hardness of Learning Monotone Functions 2008-08-28 Paper...
    10 bytes (16 words) - 10:59, 24 September 2023
  • satisfiable 3-SAT instances via autocorrelation 2021-12-09 Paper Quantum Hardness of Learning Shallow Classical Circuits 2021-06-22 Paper https://portal.mardi4nfdi...
    10 bytes (16 words) - 16:52, 6 October 2023
  • Chosen-Ciphertext Security from Subset Sum 2016-04-13 Paper On the Hardness of Learning with Rounding over Small Modulus 2016-03-23 Paper Leakage-Resilient...
    10 bytes (16 words) - 10:44, 24 September 2023
  • 2023-08-14 Paper Towards classical hardness of module-LWE: the linear rank case 2023-03-21 Paper On the hardness of module learning with errors with short distributions...
    10 bytes (16 words) - 12:50, 6 October 2023
  • Publication Date of Publication Type Estimation of the hardness of the learning with errors problem with a restricted number of samples 2019-05-21 Paper...
    10 bytes (16 words) - 09:17, 25 September 2023
  • transform 2015-08-20 Paper On the hardness of learning queries from tree structured data 2015-05-11 Paper Algorithms and complexity results for labeled correlation...
    10 bytes (16 words) - 02:14, 25 September 2023
  • 2020-05-20 Paper Secure outsourcing of cryptographic circuits 2018-11-07 Paper On the hardness of sparsely learning parity with noise 2018-11-07 Paper...
    10 bytes (16 words) - 13:54, 24 September 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)