Completeness (cryptography)

In cryptography, a boolean function is said to be complete if the value of each output bit depends on all input bits. This is a desirable property to… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1965-2018
010203019652018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Current techniques for query answering over DL-Lite ontologies have severe limitations in practice, since they either produce… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We propose a notion of an extended dominating set where each node in an ad hoc network is covered by either a dominating neighbor… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
New tools are presented for reasoning about properties of recursively de-ned domains. We work within a general, category… (More)
Is this relevant?
1995
1995
Extra variables in a clause are variables which occur in the body but not in the head. It has been argued that extra variables… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We present a new complexity theoretic approach to incremental computation. We de ne complexity classes that capture the intuitive… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We explain and advance Levin’s theory of average case completeness. In particular, we exhibit examples of problems complete in… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We investigate the interactions of subtyping and recursive types, in a simply typed λ-calculus. The two fundamental questions… (More)
Is this relevant?
Highly Cited
1982
Highly Cited
1982
Two complexity measures for query languages are proposed. Data complexity is the complexity of evaluating a query in the language… (More)
Is this relevant?
Highly Cited
1974
Highly Cited
1974
It is widely believed that showing a problem to be NP-complete is tantamount to proving its computational intractability. In this… (More)
  • figure I
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?