Results 21 to 30 of about 11,198,718 (212)

A Complexity-Theoretic Perspective on Innovation Policy [PDF]

open access: yes, 2017
It is argued that innovation policy based on notions of market failure or system failure is too limited in the context of current societal challenges. I propose a third, complexity-theoretic approach.
Frenken, K.   +4 more
core   +1 more source

Governing Complexity in World Politics

open access: yes, 2021
Complexity is the new global ontology for world politics. This article summarizes the characteristics of complexity and its implications for informed US state policy making.
Western, Jon, Haas, Peter M
core   +1 more source

Glassy Nature of the Hard Phase in Inference Problems

open access: yesPhysical Review X, 2019
An algorithmically hard phase is described in a range of inference problems: Even if the signal can be reconstructed with a small error from an information-theoretic point of view, known algorithms fail unless the noise-to-signal ratio is sufficiently ...
Fabrizio Antenucci   +3 more
doaj   +1 more source

Time-memory trade-off in Toom-Cook multiplication: an application to module-lattice based cryptography

open access: yesTransactions on Cryptographic Hardware and Embedded Systems, 2020
Since the introduction of the ring-learning with errors problem, the number theoretic transform (NTT) based polynomial multiplication algorithm has been studied extensively.
Jose Maria Bermudo Mera   +2 more
doaj   +1 more source

Hedonic Seat Arrangement Problems [PDF]

open access: yes, 2020
In this paper, we study a variant of hedonic games, called Seat Arrangement. The model is defined by a bijection from agents with preferences to vertices in a graph. The utility of an agent depends on the neighbors in the graph.
Yorke-Smith, Neil   +11 more
core   +2 more sources

Instance complexity of Boolean functions [PDF]

open access: yes, 2023
In the area of query complexity of Boolean functions, the most widely studied cost measure of an algorithm is the worst-case number of queries made by it on an input.
Mande, Nikhil S., Liu, Alison
core  

Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs [PDF]

open access: yes, 2020
We consider two optimization problems in planar graphs. In MAXIMUM WEIGHT INDEPENDENT SET OF OBJECTS we are given a graph G and a family D of objects, each being a connected subgraph of G with a prescribed weight, and the task is to find a maximum-weight
Wiese, Andreas   +7 more
core   +2 more sources

Algorithms and Complexity Results for the Capacitated Vertex Cover Problem [PDF]

open access: yes, 2019
We study the capacitated vertex cover problem (CVC). In this natural extension to the vertex cover problem, each vertex has a predefined capacity which indicates the total amount of edges that it can cover.
Sub Algorithms and Complexity   +3 more
core   +2 more sources

Compact and Low-Latency FPGA-Based Number Theoretic Transform Architecture for CRYSTALS Kyber Postquantum Cryptography Scheme

open access: yesInformation
In the modern era of the Internet of Things (IoT), especially with the rapid development of quantum computers, the implementation of postquantum cryptography algorithms in numerous terminals allows them to defend against potential future quantum attack ...
Binh Kieu-Do-Nguyen   +6 more
doaj   +1 more source

Information-Theoretic Data Discarding for Dynamic Trees on Data Streams

open access: yesEntropy, 2013
Ubiquitous automated data collection at an unprecedented scale is making available streaming, real-time information flows in a wide variety of settings, transforming both science and industry.
Christoforos Anagnostopoulos   +1 more
doaj   +1 more source

Home - About - Disclaimer - Privacy