Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
least upper bound
Description:
The smallest element in an ordered set that is greater than or equal to every element of a specified subset.
Related topics:
Logic, programming, and type systems (11%),
Advanced Algebra and Logic (10%)
Wikidata ID:
wiki/Q215071
OpenAlex ID:
keywords/least-upper-bound
Bounds on the number of hidden neurons in multilayer perceptrons
1991
·
S.-C. Huang
, Y.-F. Huang
·
IEEE Transactions on Neural Networks
·
360
Variational Theory of Chemical Reaction Rates Applied to Three-Body Recombinations
1960
·
James C. Keck
·
The Journal of Chemical Physics
·
325
Projections in Banach Algebras
1951
·
Irving Kaplansky
·
Annals of Mathematics
·
314
Efficient implementation of lattice operations
1989
·
Hassan Aït-Kaci
, Robert Boyer
, et al.
·
ACM Transactions on Programming Languages and Systems
·
222
PDF
Boundedness Properties in Function-Lattices
1949
·
M. H. Stone
·
Canadian Journal of Mathematics
·
188
PDF
Analysis of hierar hical fixed-priority scheduling
2005
·
S. Saewong
, R.R. Rajkumar
, et al.
·
Euromicro Conference on Real-Time Systems (ECRTS)
·
166
Scalar aggregation in inconsistent databases
2003
·
Marcelo Arenas
, Leopoldo Bertossi
, et al.
·
Theoretical Computer Science
·
151
PDF
Statistical "Discoveries" and Effect-Size Estimation
1989
·
Branko Sorić
·
Journal of the American Statistical Association
·
149
An extended limit analysis of three-dimensional slope stability
2012
·
Y.F. GAO
, F. ZHANG
, et al.
·
Géotechnique
·
148
The Probability of Losing an Allele When Diploid Genotypes are Sampled
1980
·
Hans-Rolf Gregorius
·
Biometrics
·
127
Injective Hulls of Semilattices
1970
·
G. Bruns
, H. Lakser
·
Canadian Mathematical Bulletin
·
103
PDF
A Theory of Synchronous Relational Interfaces
2011
·
Stavros Tripakis
, Ben Lickly
, et al.
·
ACM Transactions on Programming Languages and Systems
·
88
PDF
Algorithms for an optimal A* search and linearizing the search in the stack decoder
1991
·
D.B. Paul
·
IEEE International Conference on Acoustics Speech and Signal Processing
·
84
The Completion of a Lattice Ordered Group
1969
·
Paul Conrad
, Donald McAlister
·
Journal of the Australian Mathematical Society
·
83
PDF
Liminf convergence in Ω-categories
1997
·
Kim Ritter Wagner
·
Theoretical Computer Science
·
77
PDF
Inferring Argument Size Relationships with CLP(R)
·
Florence Benoy
, Andy King
·
73
The Normal Completion of the Lattice of Continuous Functions
1990
·
R. P. Dilworth
·
Birkhäuser Boston eBooks
·
67
Inferring argument size relationships with CLP( $$\mathcal{R}$$ )
1997
·
Florence Benoy
, Andy King
·
Lecture notes in computer science
·
65
PDF
Intermittent Faults: A Model and a Detection Procedure
1974
·
S. Kamal
, C.V. Page
·
IEEE Transactions on Computers
·
65
From Operational Semantics to Domain Theory
1996
·
Ian A. Mason
, Scott F. Smith
, et al.
·
Information and Computation
·
61
Bases for Chain-complete Posets
1976
·
G. Markowsky
, B. K. Rosen
·
IBM Journal of Research and Development
·
60
Freeze after writing: quasi-deterministic parallel programming with LVars
2014
·
Lindsey Kuper
, Aaron Turon
, et al.
·
ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)
·
59
On the Efficiency of Psychophysical Measurement
1971
·
M. M. Taylor
·
The Journal of the Acoustical Society of America
·
57
Energy cycle and bound of Qi chaotic system
2017
·
Guoyuan Qi
, Jiangfeng Zhang
·
Chaos Solitons & Fractals
·
54
Optimal groundness analysis using propositional logic
1996
·
Agostino Cortesi
, Gilberto File'
, et al.
·
The Journal of Logic Programming
·
54
PDF
Show more works
View as search
Works count:
467
Citation count:
5,871
Year
Topic
Type