Skip to search formSkip to main contentSkip to account menu

Provable prime

Known as: Provable 
In number theory, a provable prime is an integer that has been calculated to be prime using a primality-proving algorithm. Contrast with probable… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations
AKS primality testAlgorithmGenerating primesPrimality test

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Multiple Infection Sources Identification with Provable Guarantees
Given an aftermath of a cascade in the network, i.e. a set VI of "infected" nodes after an epidemic outbreak or a propagation of… 
Highly Cited
2014
Highly Cited
2014
Online load balancing for MapReduce with skewed data input
MapReduce has emerged as a powerful tool for distributed and scalable processing of voluminous data. In this paper, we, for the… 
2011
2011
Design of Protein-Protein Interactions with a Novel Ensemble-Based Scoring Algorithm
Protein-protein interactions (PPIs) are vital for cell signaling, protein trafficking and localization, gene expression, and many… 
2011
2011
A Sandwich Approach for Evacuation Time Bounds
In this article, we propose a novel modeling approach – the sandwich approach – to deal with evacuation time bounds (ETB) - in… 
Review
2008
Review
2008
On the Capacity Optimization for MIMO Ad Hoc Networks
Maximizing the system mutual information for MIMO ad hoc networks is considered in this paper. We first give a brief overview of… 
2005
2005
Robust network-based attack attribution through probabilistic watermarking of packet flows
Network based intruders often stage their attacks through intermediate ”stepping stones” to conceal their identity and origin. To… 
1995
1995
A Ramsey theorem in Boyer-Moore logic
We use the Boyer-Moore Prover, Nqthm, to verify the Paris-Harrington version of Ramsey's theorem. The proof we verify is a… 
1995
1995
Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms
  • W. HartS. Istrail
  • Journal of universal computer science (Online)
  • 1995
  • Corpus ID: 8794212
Crystal lattices are infinite periodic graphs that occur naturally in a variety of geometries and which are of fundamental… 
1994
1994
On first-order theories with provability operator
Abstract In this paper the modal operator “x is provable in Peano Arithmetic” is incorporated into first-order theories. A… 
1990
1990
A note on the load balancing problem for coarse grained hypercube dictionary machines
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)