Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
arithmetic formulas
Description:
Arithmetic formulas are mathematical expressions or rules that specify calculations involving numbers and operations.
Primary topic:
Complexity and Algorithms in Graphs (32%)
Related topics:
Complexity and Algorithms in Graphs (32%),
Analytic Number Theory Research (12%),
Advanced Mathematical Identities (7%)
OpenAlex ID:
keywords/arithmetic-formulas
Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer
1992
·
David Chaum
, Eugène van Heijst
, et al.
·
Lecture notes in computer science
·
224
PDF
Derandomizing polynomial identity tests means proving circuit lower bounds
2003
·
Valentine Kabanets
, Russell Impagliazzo
·
ACM Symposium on Theory of Computing (STOC)
·
152
Partial Garbling Schemes and Their Applications
2014
·
Yuval Ishai
, Hoeteck Wee
·
Lecture notes in computer science
·
110
Interactive PCP
2008
·
Yael Tauman Kalai
, Ran Raz
·
Lecture notes in computer science
·
99
Tensor-Rank and Lower Bounds for Arithmetic Formulas
2013
·
Ran Raz
·
Journal of the ACM
·
72
Kesalahan Siswa Smp Dalam Menyelesaikan Soal Cerita Pada Materi Aritmatika Sosial
2020
·
Nita Yunia
, Luvy Sylviana Zanthy
·
Teorema Teori dan Riset Matematika
·
66
PDF
Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys
2013
·
Benny Applebaum
, Yuval Ishai
, et al.
·
Lecture notes in computer science
·
65
PDF
Tensor-rank and lower bounds for arithmetic formulas
2010
·
Ran Raz
·
ACM Symposium on Theory of Computing (STOC)
·
57
Derandomizing polynomial identity tests means proving circuit lower bounds
2003
·
Valentine Kabanets
, Russell Impagliazzo
·
ACM Symposium on Theory of Computing (STOC)
·
51
Short Proofs for the Determinant Identities
2015
·
Pavel Hrubeš
, Iddo Tzameret
·
SIAM Journal on Computing
·
48
PDF
More on Noncommutative Polynomial Identity Testing
2005
·
A. Bogdanov
, Hoeteck Wee
·
IEEE Conference on Computational Complexity (CCC)
·
48
Two is the fastest prime: lambda coordinates for binary elliptic curves
2014
·
Thomaz Oliveira
, Julio López
, et al.
·
Journal of Cryptographic Engineering
·
47
Graph-Based Representations of Discrete Functions
1996
·
Shin-ichi Minato
·
Springer eBooks
·
39
The limits of depth reduction for arithmetic formulas: it's all about the top fan-in
2014
·
Mrinal Kumar
, Shubhangi Saraf
·
ACM Symposium on Theory of Computing (STOC)
·
32
Untitled
2019
·
Chi-Ning Chou
, Mrinal Kumar
, et al.
·
Theory of Computing
·
28
PDF
Factors of low individual degree polynomials
2016
·
Rafael Oliveira
·
Computational Complexity
·
27
PDF
Relationless Completeness and Separations
2010
·
Pavel Hrubes
, Avi Wigderson
, et al.
·
IEEE Conference on Computational Complexity (CCC)
·
27
An explicit arithmetic formula for the Fourier coefficients of Siegel–Eisenstein series of degree two and square-free odd levels
2008
·
Yoshinori Mizuno
·
Mathematische Zeitschrift
·
27
Learning Read-Onee Formulas over Fields and Extended Bases
1991
·
Thomas Hancock
, Lisa Hellerstein
·
Elsevier eBooks
·
26
An arithmetic formula for the partition function
2007
·
Kathrin Bringmann
, Ken Ono
·
Proceedings of the American Mathematical Society
·
25
PDF
A derivation of the Hardy-Ramanujan formula from an arithmetic formula
2012
·
Michael Dewar
, M. Murty
·
Proceedings of the American Mathematical Society
·
20
PDF
The Li criterion and the Riemann hypothesis for the Selberg class II
2009
·
Sami Omar
, Kamel Mazhouda
·
Journal of Number Theory
·
20
PDF
On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
2007
·
Uffe Flarup
, Pascal Koiran
, et al.
·
Springer eBooks
·
20
PDF
Data exchange with arithmetic operations
2013
·
Balder ten Cate
, Phokion G. Kolaitis
, et al.
·
International Conference on Extending Database Technology (EDBT)
·
19
Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys
2015
·
Benny Applebaum
, Yuval Ishai
, et al.
·
SIAM Journal on Computing
·
18
Show more works
View as search
Works count:
147
Citation count:
1,758
Year
Topic
Type