Výsledky vyhľadávania - "Exponential-time algorithm"

Capacitated network design games with weighted players Autor Chassein, André, Krumke, Sven O., Thielen, Clemens

“… In these games, each player has to choose a path from her source to her sink through a network subject to the constraint that the total weight of all players using an edge within their chosen path…”
Získať plný text

Castelnuovo–Mumford Regularity and Computing the de Rham Cohomology of Smooth Projective Varieties Autor Scheiblechner, Peter

“… . It is the first single exponential time algorithm for computing the Betti numbers of a significant class of complex varieties of arbitrary dimension…”
Získať plný text

A structural approach to matching problems with preferences Autor McDermid, Eric J

“…This thesis is a study of a number of matching problems that seek to match together pairs or groups of agents subject to the preferences of some or…”
Získať plný text

Modeling, analysis and design of linear systems with switching delays Autor Jungers, R M, D'Innocenzo, A, Di Benedetto, M D

“… the routing in a multi-hop communication network. We show how to model these systems as regular switching linear systems and, as a corollary, we provide an (exponential-time…”
Získať plný text

Review of the Solutions of the Clay Millennium Problem about P ≠ NP =EXPTIME Autor Kyritsis, Konstantinos E.

“…In this paper I present probably the simplest possible abstract formal proof that P ≠ NP, and NP=EXPTIME, in the context of the Zermelo-Frankel set theory and…”
Získať plný text

Algorithms for Circuits and Circuits for Algorithms Autor Williams, Ryan

“…The title of this paper is meant to highlight an emerging duality between two fundamental topics in algorithms and complexity theory. Algorithms for circuits}…”
Získať plný text

Upper and Lower Bounds for Weak Backdoor Set Detection Autor Misra, Neeldhara, Ordyniak, Sebastian, Raman, Venkatesh, Szeider, Stefan

“…We obtain upper and lower bounds for running times of exponential time algorithms for the detection of weak backdoor sets of 3CNF formulas, considering various base classes…”
Získať plný text

Minimum Length Scheduling for Discrete-Rate Full-Duplex Wireless Powered Communication Networks Autor Muhammad Shahid Iqbal, Yalcin Sadi, Coleri, Sinem

“… it can harvest until the end of its transmission. Considering this model, we propose a novel discrete rate based minimum length scheduling problem to determine the optimal power control, rate adaptation and transmission schedule subject to data…”
Získať plný text