Suchergebnisse - Singly-exponential time algorithm

Dynamic Consistency of Conditional Simple Temporal Networks via Mean Payoff Games: A Singly-Exponential Time DC-checking von Comin, Carlo, Rizzi, Romeo

“… Tsamardinos, Vidal and Pollack gave a doubly-exponential time algorithm for deciding whether a CSTN is dynamically-consistent and to produce, in the positive case, a dynamic execution strategy of exponential …”
Volltext

Checking Dynamic Consistency of Conditional Hyper Temporal Networks via Mean Payoff Games (Hardness and (pseudo) Singly-Exponential Time Algorithm) von Comin, Carlo, Rizzi, Romeo

“… ) singly-exponential time algorithm for the problem of checking …”
Volltext

A Singly-Exponential Time Algorithm for Computing Nonnegative Rank von Moitra, Ankur

“… \((nm)^{O(r^2)}\). This is the first exact algorithm that runs in time singly-exponential in \(r\). This algorithm …”
Volltext

Instantaneous Reaction-Time in Dynamic-Consistency Checking of Conditional Simple Temporal Networks von Cairo, Massimo, Comin, Carlo, Rizzi, Romeo

“… , in [Comin and Rizzi, TIME 2015] we introduced ε-DC (a refined, more realistic, notion of DC …”
Volltext

Computing the First Betti Number of a Semi-Algebraic Set von Basu, Saugata, Pollack, Richard, Roy, Marie-Françoise

“… In this paper we describe a singly exponential algorithm for computing the first Betti number of a given semi-algebraic set …”
Volltext

Computing the first few Betti numbers of semi-algebraic sets in single exponential time von Basu, Saugata

“… ) , which is singly exponential in k for ℓ any fixed constant. Previously, singly exponential time algorithms were known only for computing the Euler–Poincaré …”
Volltext

Dynamic Consistency of Conditional Simple Temporal Networks via Mean Payoff Games: a Singly-Exponential Time DC-Checking von Comin, Carlo, Rizzi, Romeo

“… Tsamardinos, Vidal and Pollack gave a doubly-exponential time algorithm for deciding whether a CSTN is dynamically-consistent and to produce, in the positive case, a dynamic execution strategy of exponential …”
Volltext

Upward Book Embeddability of st-Graphs: Complexity and Algorithms von Binucci, Carla, Da Lozzo, Giordano, Di Giacomo, Emilio, Didimo, Walter, Mchedlidze, Tamara, Patrignani, Maurizio

“… ). In a companion paper, Heath and Pemmaraju (SIAM J Comput 28(5), 1999) proved that the problem is linear-time solvable for k …”
Volltext

On Isomorphism Testing of Groups with Normal Hall Subgroups von 乔友明 Jayalal Sarma M.N. 唐邦晟

“… A normal Hall subgroup N of a group G is a normal subgroup with its order coprime with its index. Schur- Zassenhaus theorem states that every normal Hall …”
Volltext

Computability of pressure for subshifts on countable amenable groups von Hedges, C Evans, Pavlov, Ronnie

Volltext

Triangular decomposition of semi-algebraic systems von Chen, Changbo, Davenport, James H., May, John P., Moreno Maza, Marc, Xia, Bican, Xiao, Rong

“… Under some simplifying assumptions, the lazy decomposition can be computed in singly exponential time w.r.t. the number of variables …”
Volltext

Computing zeta functions of large polynomial systems over finite fields von Cheng, Qi, Maurice Rojas, J., Wan, Daqing

“… ] (on universal equivalence of programs over finite fields) to singly exponential time. One key new ingredient is an effective, finite field version of the classical Kronecker theorem which (set-theoretically …”
Volltext

Parameterized Modal Satisfiability von Achilleos, Antonis, Lampis, Michael, Mitsou, Valia

“… time’s dependence on the parameters is a tower of exponentials (unless P = NP). To overcome this limitation we propose possible alternative parameters, namely diamond dimension and modal width …”
Volltext

Combinatorial and algebraic algorithms in set covering and partitioning problems von Yu, Huiwen

“… One direction to study NP-hard problems is to find polynomial-time approximation algorithms which aim at improving the approximation guarantee …”
Volltext

Reactive Synthesis for DECLARE via symbolic automata von Geatti, Luca, Montali, Marco, Rivkin, Andrey

“… We provide a threefold contribution. First, we give a naive, doubly exponential time synthesis algorithm for this problem …”
Volltext

Computational Complexities of Folding von Eppstein, David

“… Under the exponential time hypothesis, the singly-exponential dependence of our algorithm on treewidth is necessary, even for bounded ply …”
Volltext

Approximate the k-Set Packing Problem by Local Improvements von Furer, Martin, Yu, Huiwen

“… With the same approximation guarantee, our algorithm runs in time singly exponential in \(\frac{1}{\epsilon^2}\), while the running time of Cygan's algorithm is doubly exponential …”
Volltext

Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems von Eiben, Eduard, Majumdar, Diptapriyo, Ramanujan, M S

“… and give a fixed-parameter algorithm parameterized by k and p on graphs of bounded degeneracy. In case we remove the assumption of the input graph being bounded degenerate, then the STEINER SUBGRAPH EXTENSION problem becomes W …”
Volltext

Fast \((1+\varepsilon)\)-Approximation Algorithms for Binary Matrix Factorization von Velingker, Ameya, Vötsch, Maximilian, Woodruff, David P, Zhou, Samson

“… \)-approximation for some constant \(C\ge 576\). We give the first \((1+\varepsilon)\)-approximation algorithm using running time singly exponential in \(k\), where \(k …”
Volltext

Computability of Pressure for Subshifts on Countable Amenable Groups von C Evans Hedges, Pavlov, Ronnie

“… There are a variety of results in the literature proving forms of computability for topological entropy and pressure on subshifts. In this work, we prove two …”
Volltext