Filters








12,270 Hits in 4.0 sec

Lower bounds for algebraic computation trees of functions with finite domains [chapter]

Nader H. Bshouty
1991 Lecture Notes in Computer Science  
We flIld lower bounds on the depth of computation trees with the operations (+, -,X ,I) uE that compute funt;tions f :;1 -4~, where E is the set of all functions  ...  Section 2 includes some basic definitions and preliminary results. In section 3 we prove lower bounds for some functions with finite domains..  ...  Any minimal straight line algorithm for 1 is a computation tree that almost computes I. Technion -Computer Science Department -Tehnical Report CS0576 -1989 ·8· ) . 1 .  ... 
doi:10.1007/3-540-54029-6_154 fatcat:otkefcsbzjhyxcggfn4hqaukj4

Efficient reducibility between programming systems (Preliminary Report)

Nancy A. Lynch, Edward K. Blum
1977 Proceedings of the ninth annual ACM symposium on Theory of computing - STOC '77  
The primary aim here is to obtain upper and lower bounds on flowchart complexity; however, the best flowchart upper bounds we have obtained for the operations studied in this section have arisen through  ...  Substitution of F' in F" yields the desired bound.The other constructions are similar; a few programming tricks are needed, for example for (g)"[] It is not difficult to obtain corresponding lower bounds  ...  We are working on the isolation of the relevant algebraic properties sufficient to derive lower bounds and realistic upper bounds for relative complexity of interesting problems.  ... 
doi:10.1145/800105.803413 dblp:conf/stoc/LynchB77 fatcat:gp5oikxiybhjbgbrkad7cd4ayq

Marked Ancestor Problems (Preliminary Version)

Stephen Alstrup, Thore Husfeldt, Theis Rauhe
1998 BRICS Report Series  
<br /> We show tight upper and lower bounds for this problem. The lower bounds are proved in the cell probe model, the upper bounds run on a unit-cost RAM.  ...  These include planar range searching, including the existential or emptiness problem, priority search trees, static tree union-find, and several problems from dynamic computational geometry, including  ...  We show that with respect to single operation worst case bounds, the problem is not easier than the general problem. lower bounds for computational geometry: Cell probe lower bounds are given for a number  ... 
doi:10.7146/brics.v5i7.19279 fatcat:5pkc3trj6ncrhad4urtk7skuyu

Classification of finite-dimensional compact topological algebras, preliminary report [article]

Walter Taylor
2014 arXiv   pre-print
For A a one-simplex (i.e., a closed real interval), is there some simple characterization of the set of all Σ compatible with A?  ...  For example, if A is compatible with Σ, can this fact be deduced from the compatibility of A with some Γ that involves only ternary operations?  ...  For the fact that Σ ∧ Γ is a greatest lower bound, let us suppose that Φ is a set of equations with operation symbols G i (i ∈ I), and that there are terms α i (resp. β i ) interpreting Φ in Σ (resp.  ... 
arXiv:1402.3734v1 fatcat:arndn5jrozb6falbo6wip4aczq

On k-piecewise testability (preliminary report) [article]

Tomáš Masopust, Michaël Thomazo
2015 arXiv   pre-print
We provide a complexity bound and a detailed analysis for small k's. The result can be used to find the minimal k for which the language is k-PT.  ...  We show that the upper bound on k given by the depth of the minimal DFA can be exponentially bigger than the minimal possible k, and provide a tight upper bound on the depth of the minimal DFA recognizing  ...  It also provides a smaller bound on the length of the witnesses, which results in a single exponential algorithm to find the minimal k.  ... 
arXiv:1412.1641v2 fatcat:orcnn2qxojewlmddclfsc5frxa

How to Work with Honest but Curious Judges? (Preliminary Report)

Jun Pang, Chenyi Zhang
2009 Electronic Proceedings in Theoretical Computer Science  
We extend their protocol in two different ways for an arbitrary number of 2n+1 judges.  ...  The three-judges protocol, recently advocated by Mclver and Morgan as an example of stepwise refinement of security protocols, studies how to securely compute the majority function to reach a final verdict  ...  We thank Saša Radomirović for many discussions on secure multi-party computation and Hongyang Qu for helping us with MCMAS. We also thank the anonymous referees for their valuable comments.  ... 
doi:10.4204/eptcs.7.3 fatcat:jhrtdrgjzzbpviwaa2nivsxqwq

Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses☆☆A preliminary version of this report was presented at the Fifth Canadian Conference on Computational Geometry [32]

David M. Mount, Nathan S. Netanyahu
2001 Computational geometry  
We present randomized algorithms for these estimators, whose expected running times are O(n 2 log n) for the circular case and O(n 3 log n) for the elliptical case.  ...  In this paper we introduce nonlinear Theil-Sen and repeated median (RM) variants for estimating the center and radius of a circular arc, and for estimating the center and horizontal and vertical radii  ...  Also, we are grateful to Azriel Rosenfeld for his comments, and Kathy Bumpass for her help in preparing this paper.  ... 
doi:10.1016/s0925-7721(01)00009-8 fatcat:2zu335ecerg57fagk7gnzwjwee

Page 4490 of Mathematical Reviews Vol. , Issue 97G [page]

1997 Mathematical Reviews  
Grigor’ev], Marek Karpinski, Friedhelm Meyer auf der Heide and Roman Smolensky, A lower bound for randomized algebraic decision trees (612-619); William Evans and Nicholas Pippenger, Lower bounds for noisy  ...  search (311-317); Thomas Drakengren and Peter Jonsson, Max- imal tractable subclasses of Allen’s interval algebra: preliminary report (389-394); Gérard Ligozat, A new proof of tractability for ORD-Horm  ... 

Page 1567 of Mathematical Reviews Vol. , Issue 80D [page]

1980 Mathematical Reviews  
subsets of a free monoid (pp. 143-150); Harold Abelson, Lower bounds on information transfer in distributed computations (pp. 151-158); Jean-Paul Van de Wiele, An optimal lower bound on the number of  ...  Stockmeyer, Alternating pushdown automata (preliminary report) (pp. 92- 106); Janos Simon, John Gill and James Hunt, On tape-bounded probabilistic Turing machine transducers (extended abstract) (pp. 107  ... 

Page 7312 of Mathematical Reviews Vol. , Issue 90M [page]

1990 Mathematical Reviews  
Hemachandra, Lower bounds for the low hierarchy (extended abstract) (pp. 31-45); Ricardo A. Baeza-Yates and Gaston H.  ...  Garay, Asymptotically optimal distributed consensus (extended abstract) (pp. 80-94); Gianfranco Bilardi and Abha Moitra, Time lower bounds for CREW-PRAM computation of monotone functions (pp. 95-107);  ... 

Page 277 of Mathematical Reviews Vol. , Issue 81A [page]

1981 Mathematical Reviews  
Valiant, Completeness classes in algebra (pp. 249-261); Thomas Lengauer and Robert Endre Tarjan, Upper and lower bounds on time-space tradeoffs (pp. 262-277); Timothy J.  ...  Chandra and David Harel, Computable queries for relational data bases (preliminary report) (pp. 309-318); Catriel Beeri, Alberto O. 81a:68004  ... 

Page 5367 of Mathematical Reviews Vol. , Issue 90I [page]

1990 Mathematical Reviews  
Jukna, Two lower bounds for circuits over the basis (&,V,—) (preliminary report) (pp. 371- 380); Stéphane Kaplan, Positive/negative conditional rewriting (pp. 381-395); Jan Kratochvil and Mirko Krivanek  ...  Rosier and Hsu-Chun Yen, A taxonomy of fairness and tempo- ral logic problems for Petri nets (pp. 351-359); Juraj Hromkovit and Juraj Prochazka, Branching programs as a tool for proving lower bounds on  ... 

Page 3831 of Mathematical Reviews Vol. , Issue 87g [page]

1987 Mathematical Reviews  
Meyer auf der Heide, A polynomial linear search algorithm for the n-dimensional knapsack problem (pp. 70-79); M. Ben-Or, Lower bounds for algebraic computation trees (pp. 80-86); A. Borodin, D.  ...  Fich, New bounds for parallel prefix circuits (pp. 100-109); L. G. Valiant, Exponential lower bounds for restricted monotone circuits (pp. 110-117); L.  ... 

Computational Geometry (Dagstuhl Seminar 19181)

Siu-Wing Cheng, Anne Driemel, Jeff Erickson, Michael Wagner
2019 Dagstuhl Reports  
This report documents the program and the outcomes of Dagstuhl Seminar 19181 "Computational Geometry".  ...  New advances and directions in computational geometry were presented and discussed. The report collects the abstracts of talks and open problems presented in the seminar.  ...  As a preliminary result, I will present an algorithm that constructs a space decomposition for a collection of algebraic curves in 3-space, with complexity bounds similar to those of Guth.  ... 
doi:10.4230/dagrep.9.4.107 dblp:journals/dagstuhl-reports/ChengD019 fatcat:w2kqoyd5mngt7bn32gc25w4jie

Optimality and tight results in parameterized complexity (Dagstuhl Seminar 14451)

Stefan Kratsch, Daniel Lokshtanov, Dániel Marx, Peter Rossmanith, Marc Herbstritt
2015 Dagstuhl Reports  
Over the last two decades parameterized complexity has become one of the main tools for handling intractable problems.  ...  This report documents the program and the outcomes of Dagstuhl Seminar 14451 "Optimality and tight results in parameterized complexity".  ...  Furthermore, some steps in this proof can only be verified with the help of a computer, and Lower Bounds for Computing Treewidth lastly, the proof can not provide a lower bound under the Exponential Time  ... 
doi:10.4230/dagrep.4.11.1 dblp:journals/dagstuhl-reports/KratschLMR14 fatcat:vwgmhttkgrf4pb34jpsb2rfvnm
« Previous Showing results 1 — 15 out of 12,270 results