Publications related to P versus NP problem

Measurement Scheduling for Cooperative Localization in Resource-Constrained Conditions

This letter studies the measurement scheduling problem for a group of

N

mobile robots moving on a flat surface that are preforming cooperative localization (CL). We consider a scenario in which due to the limited on-board resources such as battery life a ...

2020

A Computational Method for Identifying the Optimum Buffer Size in the Era of Zero Defect Manufacturing

Ali Boujemaoui

Decreasing defects, waste time, meeting customer demand and being adaptable are the goals of a Zero Defect Manufacturing (ZDM) strategy. Scheduling is an important tool to perform that. It should take in account buffer size allocation. In this study, a met ...

SPRINGER INTERNATIONAL PUBLISHING AG2020

Efficient Allocations in Constant Time: Towards Scalable Solutions in the Era of Large Scale Intelligent Systems

Boi Faltings, Panayiotis Danassis

The next technological revolution will be interwoven to the proliferation of intelligent systems. As we bridge the gap between physical and cyber worlds, we will give rise to large-scale, multi-agent based technologies. A key challenge that cities of the f ...

IOS PRESS2020

On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem

Mika Tapani Göös

We study the search problem class PPA_q defined as a modulo-q analog of the well-known polynomial parity argument class PPA introduced by Papadimitriou (JCSS 1994). Our first result shows that this class can be characterized in terms of PPA_p for prime p. ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2020

Design of a quality control network for an international food company

Philippe Wieser, Nicolas Zufferey, Simone Lydia Voldrich

In this article, the design of a quality control network is considered in an entire supply chain, in the context of an international food and beverage company, denoted as ABC. For each possible control point of the network, two decisions have to be made: ( ...

TAYLOR & FRANCIS INC2020

Sparsity Invariance for Convex Design of Distributed Controllers

Maryam Kamgarpour, Luca Furieri, Yu Zheng

We address the problem of designing optimal linear time-invariant (LTI) sparse controllers for LTI systems, which corresponds to minimizing a norm of the closed-loop system subjected to sparsity constraints on the controller structure. This problem is NP-h ...

2020

Second-order guarantees in centralized, federated and decentralized nonconvex optimization

Ali H. Sayed, Stefan Vlaski

Rapid advances in data collection and processing capabilities have allowed for the use of increasingly complex models that give rise to nonconvex optimization problems. These formulations, however, can be arbitrarily difficult to solve in general, in the s ...

INT PRESS BOSTON, INC2020

A Crowdsourced Gameplay for Whole-Genome Assembly via Short Reads

Next-generation sequencing has revolutionized the field of genomics by producing accurate, rapid and cost-effective genome analysis with the use of high throughput sequencing technologies. This has intensified the need for accurate and performance efficien ...

INT ASSOC ONLINE ENGINEERING2020

New approach for time-resolved and dynamic investigations on nanoparticles agglomeration

Francesco Stellacci, Antonia Neels, Alex Dommann, Urszula Beata Cendrowska, Claudio Toncelli

Nanoparticle (NP) colloidal stability plays a crucial role in biomedical application not only for human and environmental safety but also for NP efficiency and functionality. NP agglomeration is considered as a possible process in monodispersed NP colloida ...

TSINGHUA UNIV PRESS2020

Boolean satisfiability in quantum compilation

Giovanni De Micheli, Mathias Soeken, Fereshte Mozafari Ghoraba, Heinz Riener, Giulia Meuli, Bruno Schmitt Antunes

Quantum compilation is the task of translating a quantum algorithm implemented in a high-level quantum programming language into a technology-dependent instructions flow for a physical quantum computer. To tackle the large gap between the quantum program a ...

ROYAL SOC2020

P versus NP problem

Graph Chatbot

Chat with Graph Search

Measurement Scheduling for Cooperative Localization in Resource-Constrained Conditions

A Computational Method for Identifying the Optimum Buffer Size in the Era of Zero Defect Manufacturing

Efficient Allocations in Constant Time: Towards Scalable Solutions in the Era of Large Scale Intelligent Systems

On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem

Design of a quality control network for an international food company

Sparsity Invariance for Convex Design of Distributed Controllers

Second-order guarantees in centralized, federated and decentralized nonconvex optimization

A Crowdsourced Gameplay for Whole-Genome Assembly via Short Reads

New approach for time-resolved and dynamic investigations on nanoparticles agglomeration

Boolean satisfiability in quantum compilation

A Computational Method for Identifying the Optimum Buffer Size in the Era of Zero Defect Manufacturing

Measurement Scheduling for Cooperative Localization in Resource-Constrained Conditions

On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem

A Crowdsourced Gameplay for Whole-Genome Assembly via Short Reads

Second-order guarantees in centralized, federated and decentralized nonconvex optimization

Sparsity Invariance for Convex Design of Distributed Controllers

Efficient Allocations in Constant Time: Towards Scalable Solutions in the Era of Large Scale Intelligent Systems

Design of a quality control network for an international food company

New approach for time-resolved and dynamic investigations on nanoparticles agglomeration

Boolean satisfiability in quantum compilation