Skip to search formSkip to main contentSkip to account menu

BIT predicate

Known as: Ackermann coding 
In mathematics and computer science, the BIT predicate or Ackermann coding, sometimes written BIT(i, j), is a predicate which tests whether the jth… 
Wikipedia (opens in a new tab)

Related topics

Related topics

15 relations
AC0Bit manipulationBitwise operationC++

Broader (2)

Circuit complexitySet theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Pedestrian safety at intersections in Dhaka metropolitan city
Pedestrian accidents are a serious and growing problem in the cities of developing countries, especially in Dhaka, the capital of… 
2014
2014
ON THE SYNTAX, MORPHOLOGY, AND SEMANTICS OF RUSSIAN VERBAL ASPECT
0. Introduction. It is generally accepted that verb forms in Russian are inflected for features of the sentence in which they… 
2014
2014
Name-bearing, reference, and circularity
Proponents of the predicate view of names explain the reference of an occurrence of a name N by invoking the property of bearing… 
2008
2008
Ehrenfeucht-Fraïssé games in finite set theory
  • Xiaoping Zhou
  • Information Processing Letters
  • 2008
  • Corpus ID: 22464824
2008
2008
Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction
Recently, a strong link has been discovered between supermodularity on lattices and tractability of optimization problems known… 
Highly Cited
2003
Highly Cited
2003
The repugnant and the mature in phylogenetic inference: atemporal similarity and historical identity
The significance of “being similar” in the inference of species relationships is refuted once again (see also Hennig, 1966… 
2002
2002
Actualism, singular propositions, and possible worlds : essays in metaphysics of modality
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Linguistics and Philosophy, 2002. 
2000
2000
Counting Modulo Quantifiers on Finite Structures
We give a combinatorial method for proving elementary equivalence in first-order logic FO with counting modulo n quantifiers Dn… 
1988
1988
Magány : vegyeskar (SABar) a cappella = Einsamkeit : gemischter Chor (SABar) a cappella = Solitude : mixed choir (SABar) a cappella
Highly Cited
1978
Highly Cited
1978
Semantics of Nondeterministic and Noncontinuous Constructs
The semantics of the nondeterministic and noncontinuous constructs of the descriptive and applicative parts of the wide spectrum… 
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)