Complexity

Results: 8084



#Item
11MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity Martin Albrecht1 , Lorenzo Grassi3 , Christian Rechberger2,3 , Arnab Roy2 , and Tyge Tiessen2 1

MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity Martin Albrecht1 , Lorenzo Grassi3 , Christian Rechberger2,3 , Arnab Roy2 , and Tyge Tiessen2 1

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2017-01-05 05:07:13
12A NOTION OF GEOMETRIC COMPLEXITY AND ITS APPLICATION TO TOPOLOGICAL RIGIDITY ERIK GUENTNER, ROMAIN TESSERA, AND GUOLIANG YU Abstract. We introduce a geometric invariant, called finite decomposition complexity (FDC), to s

A NOTION OF GEOMETRIC COMPLEXITY AND ITS APPLICATION TO TOPOLOGICAL RIGIDITY ERIK GUENTNER, ROMAIN TESSERA, AND GUOLIANG YU Abstract. We introduce a geometric invariant, called finite decomposition complexity (FDC), to s

Add to Reading List

Source URL: www.normalesup.org

Language: English - Date: 2011-10-21 02:00:00
13Coping with Inconsistent Databases Semantics, Algorithms, and Complexity Phokion G. Kolaitis University of California Santa Cruz and

Coping with Inconsistent Databases Semantics, Algorithms, and Complexity Phokion G. Kolaitis University of California Santa Cruz and

Add to Reading List

Source URL: sat2016.labri.fr

Language: English - Date: 2016-07-06 08:29:21
14Satellite	
  of	
  the	
  CCS2018	
   “Questions	
  and	
  Perspectives	
  in	
  Understanding	
  Complexity	
  via	
   Nonlinearity	
  and	
  Information	
  Theory”	
     26	
  September	
  2018

Satellite  of  the  CCS2018   “Questions  and  Perspectives  in  Understanding  Complexity  via   Nonlinearity  and  Information  Theory”     26  September  2018

Add to Reading List

Source URL: complexityscience.net

Language: English - Date: 2018-09-18 13:19:16
    15UCBoost: A Boosting Approach to Tame Complexity and Optimality for Stochastic Bandits

    UCBoost: A Boosting Approach to Tame Complexity and Optimality for Stochastic Bandits

    Add to Reading List

    Source URL: www.research.att.com

    Language: English - Date: 2018-10-03 19:00:09
    16The Complexity of Safety Stock Placement in General-Network Supply Chains Ekaterina Lesnaia, Iuliu Vasilescu, and Stephen C. Graves MIT  Abstract— We consider the optimization problem of safety

    The Complexity of Safety Stock Placement in General-Network Supply Chains Ekaterina Lesnaia, Iuliu Vasilescu, and Stephen C. Graves MIT Abstract— We consider the optimization problem of safety

    Add to Reading List

    Source URL: web.mit.edu

    Language: English - Date: 2016-06-07 13:49:55
    17Practical Template-Algebraic Side Channel Attacks with Extremely Low Data Complexity Yossef Oren, Ofir Weisse and Avishai Wool Cryptography and Network Security Lab School of Electrical Engineering Tel-Aviv University, R

    Practical Template-Algebraic Side Channel Attacks with Extremely Low Data Complexity Yossef Oren, Ofir Weisse and Avishai Wool Cryptography and Network Security Lab School of Electrical Engineering Tel-Aviv University, R

    Add to Reading List

    Source URL: www.ofirweisse.com

    Language: English - Date: 2018-10-17 09:19:20
    18

    PDF Document

    Add to Reading List

    Source URL: www.complexity.ntu.edu.sg

    - Date: 2014-10-06 04:05:12
      19

      PDF Document

      Add to Reading List

      Source URL: www.complexity.ntu.edu.sg

      - Date: 2018-03-19 21:50:57
        20Run your business while lowering overall IT cost and complexity  IBM System x3250 M2 Go green and save The x3250 M2 fits into about the same

        Run your business while lowering overall IT cost and complexity IBM System x3250 M2 Go green and save The x3250 M2 fits into about the same

        Add to Reading List

        Source URL: proservice.ge

        Language: English - Date: 2010-10-01 11:06:38