Skip to search formSkip to main contentSkip to account menu

Integer square root

Known as: Isqrt 
In number theory, the integer square root (isqrt) of a positive integer n is the positive integer m which is the greatest integer less than or equal… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
Fixed point (mathematics)Floor and ceiling functionsList of numerical analysis topicsMethods of computing square roots

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Approximate Computing in Coarse Grained Reconfigurable Architecture
Approximate computing has emerged as a new computing paradigm capable of reducing the power requirements for or accelerating some… 
2017
2017
Pipelined Implementation of a Fixed-Point Square Root Core Using Non-Restoring and Restoring Algorithm
Arithmetic Square Root is one of the most complex but nevertheless widely used operations in modern computing. A primary reason… 
2016
2016
Formal Model-Based Constraint Solving and Document Generation
Constraint solving technology for formal models has made considerable progress in the last years, and has lead to many… 
2012
2012
A fast and compact circuit for integer square root computation based on Mitchell logarithmic method
A novel non-iterative circuit for computing integer square root based on logarithm is proposed in the paper. Mitchell's methods… 
2012
2012
Operation of Integer Square Root Based on FPGA
When FPGA is used as a control chip in generator control,the operation of three-phase virtual value is necessary,and the… 
Review
2005
Review
2005
Perspex machine II: visualization
We review the perspex machine and improve it by reducing its halting conditions to one condition. We also introduce a data… 
1993
1993
The integer square root of N via a binary search
An algorithm is presented which may be used to find the integer square root of N. The method is intended for use on a binary… 
1991
1991
A fast method for finding an integer square root
  • Ken Lyons
  • FORTH '90 and '91
  • 1991
  • Corpus ID: 36562384
ABSTUCE 17u3 paper describes a fmt algorithm for obtaining the square root of an unsigned integer. Although the algorithm is not… 
1991
1991
AN INTEGER SQUARE ROOT ALGORITHM
1984
1984
PVS - design for a practical verification system
In this paper we present a new and practical approach to program verification based on the transformational program development… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)