Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,471,938 papers from all fields of science
Search
Sign In
Create Free Account
Universal quantification
Known as:
∀
, Universally quantify
, For every
Expand
In predicate logic, a universal quantification is a type of quantifier, a logical constant which is interpreted as "given any" or "for all". It…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
47 relations
Alternating finite automaton
Attempto Controlled English
Category theory
Conjunctive query
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits
Sanjam Garg
,
Craig Gentry
,
S. Halevi
,
Mariana Raykova
,
A. Sahai
,
Brent Waters
IEEE 54th Annual Symposium on Foundations of…
2013
Corpus ID: 15703414
In this work, we study indistinguishability obfuscation and functional encryption for general circuits: Indistinguishability…
Expand
Highly Cited
2012
Highly Cited
2012
On the (im)possibility of obfuscating programs
B. Barak
,
Oded Goldreich
,
+4 authors
Ke Yang
JACM
2012
Corpus ID: 2409597
Informally, an <i>obfuscator</i> <i>O</i> is an (efficient, probabilistic) “compiler” that takes as input a program (or circuit…
Expand
Highly Cited
2009
Highly Cited
2009
Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
E. Arıkan
IEEE Transactions on Information Theory
2009
Corpus ID: 889822
A method is proposed, called channel polarization, to construct code sequences that achieve the symmetric capacity I(W) of any…
Expand
Highly Cited
2006
Highly Cited
2006
Constructing Induction Rules for Deductive Synthesis Proofs
A. Bundy
,
L. Dixon
,
J. Gow
,
Jacques D. Fleuriot
Electron. Notes Theor. Comput. Sci.
2006
Corpus ID: 1644109
Highly Cited
2004
Highly Cited
2004
The Diameter of a Scale-Free Random Graph
B. Bollobás
,
O. Riordan
Comb.
2004
Corpus ID: 15239009
We consider a random graph process in which vertices are added to the graph one at a time and joined to a fixed number m of…
Expand
Highly Cited
1998
Highly Cited
1998
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
S. Arya
,
D. Mount
,
N. Netanyahu
,
R. Silverman
,
A. Wu
JACM
1998
Corpus ID: 8193729
Consider a set of <italic>S</italic> of <italic>n</italic> data points in real <italic>d</italic>-dimensional space, R<supscrpt…
Expand
Highly Cited
1998
Highly Cited
1998
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Sanjeev Arora
JACM
1998
Corpus ID: 3023351
We present a polynomial time approximation scheme for Euclidean TSP in fixed dimensions. For every fixed <italic>c</italic> > 1…
Expand
Highly Cited
1997
Highly Cited
1997
Catadioptric omnidirectional camera
S. Nayar
Proceedings of IEEE Computer Society Conference…
1997
Corpus ID: 1870519
Conventional video cameras have limited fields of view that make them restrictive in a variety of vision applications. There are…
Expand
Highly Cited
1974
Highly Cited
1974
A framework for representing knowledge
M. Minsky
1974
Corpus ID: 61610148
Highly Cited
1970
Highly Cited
1970
On the maximality of sums of nonlinear monotone operators
R. Rockafellar
1970
Corpus ID: 48057958
is called the effective domain of F, and F is said to be locally bounded at a point x e D(T) if there exists a neighborhood U of…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE