Results 21 to 30 of about 1,097 (101)

Space hierarchy theorem revised [PDF]

, 2003
We show that, for an arbitrary function h(n) and each recursive function ℓ(n), that are separated by a nondeterministically fully space constructible g(n), such that h(n)∈Ω(g(n)) but ℓ(n)∉Ω(g(n)), there exists a unary language L in NSPACE(h(n)) that is ...
Aarts, Leon P., Driessen, Antoine H., Gerritsen, Wim B., Klautz, Robert J., van Boven, Wim-Jan P., van Dongen, Erik P.   +5 more
core   +1 more source

Multiband gravitational-wave event rates and stellar physics [PDF]

, 2019
Joint gravitational-wave detections of stellar-mass black-hole binaries by ground- and space-based observatories will provide unprecedented opportunities for fundamental physics and astronomy.
Belczynski, Krzysztof, Berti, Emanuele, Chen, Yanbei, Gerosa, Davide, Ma, Sizheng, O'Shaughnessy, Richard, Wong, Kaze W. K.   +6 more
core   +4 more sources

Optimal control for the thin-film equation: Convergence of a multi-parameter approach to track state constraints avoiding degeneracies [PDF]

, 2015
We consider an optimal control problem subject to the thin-film equation which is deduced from the Navier--Stokes equation. The PDE constraint lacks well-posedness for general right-hand sides due to possible degeneracies; state constraints are used to ...
Klein, Markus, Prohl, Andreas
core   +1 more source

Preserving energy resp. dissipation in numerical PDEs using the "Average Vector Field" method

, 2012
We give a systematic method for discretizing Hamiltonian partial differential equations (PDEs) with constant symplectic structure, while preserving their energy exactly. The same method, applied to PDEs with constant dissipative structure, also preserves
Celledoni, E., Grimm, V., McLachlan, R. I., McLaren, D. I., O'Neale, D., Owren, B., Quispel, G. R. W.   +6 more
core   +1 more source

Evolutionary Approach to the Euclidean Steiner Tree Problem in n-Space

Applied Sciences
This article presents the application of a genetic algorithm for solving the Euclidean Steiner problem in spaces of dimensionality greater than 2. The Euclidean Steiner problem involves finding the minimum spanning network that connects a given set of ...
Michał Bereta
doaj   +1 more source

More Than 1700 Years of Word Equations

, 2015
Geometry and Diophantine equations have been ever-present in mathematics. Diophantus of Alexandria was born in the 3rd century (as far as we know), but a systematic mathematical study of word equations began only in the 20th century. So, the title of the
A Boudet, A Kościelski, J Ferté, L Ciobanu, O Kharlampovich, PR Asveld, RM Karp, V Diekert, W Plandowski, W Plandowski, Z Sela   +10 more
core   +1 more source

Global Versus Local Computations: Fast Computing with Identifiers

, 2017
This paper studies what can be computed by using probabilistic local interactions with agents with a very restricted power in polylogarithmic parallel time.
A Schönhage, C Delporte-Gallet, D Angluin, D Angluin, D Angluin, D Angluin, D Doty, DJ Daley, DT Gillespie, HW Hethcote, J Beauquier, J Beauquier, J Beauquier, JD Murray, O Bournez, O Michail, R Guerraoui   +16 more
core   +1 more source

Finite state verifiers with constant randomness [PDF]

, 2014
We give a new characterization of $\mathsf{NL}$ as the class of languages whose members have certificates that can be verified with small error in polynomial time by finite state machines that use a constant number of random bits, as opposed to its ...
Abuzer Yakaryılmaz, Anuj Dawar, Cem Say
core   +1 more source

Passively Mobile Communicating Logarithmic Space Machines [PDF]

, 2010
We propose a new theoretical model for passively mobile Wireless Sensor Networks. We call it the PALOMA model, standing for PAssively mobile LOgarithmic space MAchines. The main modification w.r.t.
Chatzigiannakis, Ioannis, Michail, Othon, Nikolaou, Stavros, Pavlogiannis, Andreas, Spirakis, Paul G.   +4 more
core  

The Complexity of Number Theory

, 2020
The Goldbach's conjecture has been described as the most difficult problem in the history of Mathematics. This conjecture states that every even integer greater than 2 can be written as the sum of two primes.
F. Vega
semanticscholar   +1 more source