Results 211 to 220 of about 9,394 (265)
Some of the next articles are maybe not open access.
J. Autom. Lang. Comb., 2021
Journal of Automata, Languages and Combinatorics, Volume 26, Numbers 1-2, 2021, 17 ...
Sabine Broda +3 more
openaire +2 more sources
Journal of Automata, Languages and Combinatorics, Volume 26, Numbers 1-2, 2021, 17 ...
Sabine Broda +3 more
openaire +2 more sources
Journal of the ACM, 1980
Summary: The prefix problem is to compute all the products \(x_1\circ x_2\circ \ldots x_k\) for \(i\leq k\leq n\), where \(\circ\) is an associative operation. A recursive construction is used to obtain a product circuit for solving the prefix problem which has depth exactly \([\log_2n]\) and size bounded by \(4n\).
Richard E. Ladner, Michael J. Fischer
openaire +2 more sources
Summary: The prefix problem is to compute all the products \(x_1\circ x_2\circ \ldots x_k\) for \(i\leq k\leq n\), where \(\circ\) is an associative operation. A recursive construction is used to obtain a product circuit for solving the prefix problem which has depth exactly \([\log_2n]\) and size bounded by \(4n\).
Richard E. Ladner, Michael J. Fischer
openaire +2 more sources
Computational Geometry, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
2023
AbstractWe consider fragments of first-order logic (with and without equality) defined by means of standard quantifier prefix specifiers, over signatures containing no function symbols. We determine, in each case, the decidability and complexity of the (finite) satisfiability problem. Two of these results tower above the others.
openaire +1 more source
AbstractWe consider fragments of first-order logic (with and without equality) defined by means of standard quantifier prefix specifiers, over signatures containing no function symbols. We determine, in each case, the decidability and complexity of the (finite) satisfiability problem. Two of these results tower above the others.
openaire +1 more source
ELEMENTS THAT ARE PREFIXES OR USED AS PREFIXES IN UZBEK
Tarihî gelişim seyri içinde farklı kültürel çevrelerin etkisiyle değişimler yaşamış olan Türk dili, yabancı unsurların dile girmesiyle sadece söz varlığı olarak değil söz yapımı konusunda da bu kültürlerin etkisinde kalmıştır. Doğrudan Çağataycaʻnın temsilcisi olan Özbekçe; Tacikçe, Arapça ve Farsçaʻnın büyük oranda etkilediği Türk lehçelerindendir ...openaire +1 more source
Fast address lookups using controlled prefix expansion
ACM Transactions on Computer Systems, 1999G Varghese
exaly