Time/Space-Bounded Algorithms
Restricted space algorithms for isomorphism on bounded treewidth graphs
... polynomial time nor known to be NP-complete (see [12] ...are bounded by a ...of bounded degree [14] , bounded genus [16] , bounded color classes [15] , or bounded treewidth [2] ...
13
Sampling Time-Based Sliding Windows in Bounded Space
... over time, so that the sampling fraction has to be ad- justed ...bounded space. We then introduce a novel sampling scheme called bounded priority sampling (BPS), which requires only ...
13
Faster exponential time algorithms in graphs of bounded average degree
... running time of the algorithm of Bj¨orklund et ...) time, that is, in time matching the bound for bipartite graphs, has been discovered very recently, in 2012, by Bj¨orklund ...previous ...
14
Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing
... 1.1 Related works Both the offline and online version of the bin packing problem have been well studied. The offline bin packing is NP-Hard (Garey and Johnson 1979 ). For one- dimensional bin packing, Simchi-Levi gave a ...
15
Algorithms for the bounded set-up knapsack problem
... constant time if L 0 r −1 is a linked list, with new items being added to the beginning of the ...U}) time using pointers, and their method is trivially modified to merge three ...U}) time and O(n ...
7
Improved Steiner tree algorithms for bounded treewidth
... We want to support this operation with the best-possible running time of O( tw ) . Since the tables at the decomposition tree’s nodes have the size O( B tw + 2 · tw ) , we can easily allow for a look-up ...
12
Numerical algorithms for the time space tempered fractional Fokker Planck equation
... In recent decades, fractional partial differential equations have become a powerful tool to model the particle transport in anomalous diffusion in various fields. Effectively solving them naturally becomes an urgent topic of ...
17
Computation by interaction for space-bounded functional programming
... Each time we ask for a character, the program will request from the input word the characters that it needs to compute the requested ...in algorithms with logarithmic space ...
52
Non-malleable codes for space-bounded tampering
... s-bounded algorithms, for some parameter s ∈ N ...decoding algorithms that are d-bounded for some value d ≤ s, the standard notion of non-malleability is impossible to achieve, as in such a ...
34
Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs
... the time complexity by at most a factor of ∆; this loss is considered negligible, since all the time and space complexities of algorithms in this area are anyway at least polynomial in ...
19
our algorithms will work and our results will hold even when the context space is discrete given that it is bounded. arm (or an alternative).
... each time instant are made depending on the best context from the set of contexts available at that time ...learning algorithms, for which such online performance bounds have not been ...
15
On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow
... 1981 - Koubek and ˇ Ríha - combinatorial algorithm for the maximum length bounded flow flawed 1995 - Bar-Noy et al. - L-bounded cut NP-hard 2002 - K. and Scheideler - L-bounded flow in P, by ...
36
Bounded Solutions of Ideal MHD with Compact Support in Space-Time
... There exist bounded, compactly supported weak solutions of ideal MHD in R3 , with both u, B nontrivial, such that neither total energy nor cross helicity is conserved in time, but magnet[r] ...
43
Time- and Space-Efficient Self-Stabilizing Algorithms
... new time- and space-efficient self-stabilizing algorithms for well-known problems in algorithmic graph theory and provides new complexity analyses for existing ...the algorithms. All ...
160
Describing Chaos of Continuous Time System Using Bounded Space Curve
... first time in history of mathematics and ...continuous time system, while chaos theory put forward by Li-Yorke includes concept of discrete chaos ...
14
Four Algorithms for Boundary Control with Breaking in Space and Time
... Vladimir Arabadzhi Division of Geophysical Research, Institute of Applied Physics, Nizhny Novgorod, Russian Abstract Typically, active control systems either have a priori complete information about the boundary-value ...
11
Derandomizing Isolation in Space-Bounded Settings
... We now have all the ingredients to establish our efficient unambiguous machines for LogCFL. Proof of Theorem 17. By way of Proposition 18, it suffices to construct an unambiguous machine that decides 11 Circuit ...
32
Nemytskii operator on generalized bounded variation space
... variation space into itself and satisfies some Lipschitz condi- tion, then there are two functions g and h belonging to the (φ, α)-bounded variation space such that f (t, y) = g(t)y + h(t) for all t ∈ ...
20
Regular variational problems in the space of bounded variation
... CHAPTER 2 VARIATIONAL PROBLEMS OF MEAN CURVATURE TYPE 2.1 Introduction... ABSTRACT.[r] ...
123
P-FPT algorithms for bounded clique-width graphs
... We want to further stress that the quotient graphs of (q, q − 3)-graphs may have unbounded order. In particular, our results for these graphs are evidence that our general approach in the paper can also be applied to ...
67