Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
counting arguments
Description:
Mathematical proofs that establish a result by counting the same objects or quantities in different ways.
Related topics:
Advanced Combinatorial Mathematics (14%),
Limits and Structures in Graph Theory (10%),
Complexity and Algorithms in Graphs (10%)
OpenAlex ID:
keywords/counting-arguments
Dimensional Reduction in Quantum Gravity
1993
·
Hooft, G. 't
·
arXiv (Cornell University)
·
3,971
PDF
Dimensional reduction in quantum gravity
1993
·
Gerard ’t Hooft
·
Utrecht University Repository (Utrecht University)
·
1,097
Relative to a Random Oracle A , ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
1981
·
Charles H. Bennett
, John Gill
·
SIAM Journal on Computing
·
454
Band touching from real-space topology in frustrated hopping models
2008
·
Doron L. Bergman
, Congjun Wu
, et al.
·
Physical Review B
·
444
PDF
BPP and the polynomial hierarchy
1983
·
Clemens Lautemann
·
Information Processing Letters
·
246
Tunneling and quantum noise in one-dimensional Luttinger liquids
1995
·
C. de C. Chamon
, D. E. Freed
, et al.
·
Physical review. B, Condensed matter
·
196
PDF
Testing polynomials which are easy to compute (Extended Abstract)
1980
·
J. Heintz
, C. P. Schnorr
·
ACM Symposium on Theory of Computing (STOC)
·
184
PDF
Probabilistic communication complexity
1986
·
Ramamohan Paturi
, Janos Simon
·
Journal of Computer and System Sciences
·
164
Constructive Proofs of Concentration Bounds
2010
·
Russell Impagliazzo
, Valentine Kabanets
·
Lecture notes in computer science
·
120
Efficient simulation of finite automata by neural nets
1991
·
Noga Alon
, A. K. Dewdney
, et al.
·
Journal of the ACM
·
107
PDF
Properties of almost all graphs and complexes
1979
·
Andreas Blass
, Frank Harary
·
Journal of Graph Theory
·
104
On off-shell supermultiplets
1981
·
W. Siegel
, M. Roček
·
Physics Letters B
·
102
The error exponent for the noiseless encoding of finite ergodic Markov sources
1981
·
L. Davisson
, G. Longo
, et al.
·
IEEE Transactions on Information Theory
·
90
Drawing Graphs in the Plane with High Resolution
1993
·
M. Formann
, T. Hagerup
, et al.
·
SIAM Journal on Computing
·
85
The entropic prior for distributions with positive and negative values
1998
·
M. P. Hobson
, A. N. Lasenby
·
Monthly Notices of the Royal Astronomical Society
·
83
PDF
Tight asymptotic bounds for the deletion channel with small deletion probabilities
2010
·
Adam Kalai
, Michael Mitzenmacher
, et al.
·
IEEE International Symposium on Information Theory (ISIT)
·
75
Narrow Proofs May Be Maximally Long
2016
·
Albert Atserias
, Massimo Lauria
, et al.
·
ACM Transactions on Computational Logic
·
71
One-way log-tape reductions
1978
·
J. Hartmanis
, N. Immerman
, et al.
·
Annual Symposium on Foundations of Computer Science
·
71
Improved Approximations for k-Exchange Systems
2011
·
Moran Feldman
, Joseph Naor
, et al.
·
Lecture notes in computer science
·
66
On the Wake-Up Problem in Radio Networks
2005
·
Bogdan S. Chlebus
, Leszek Gąsieniec
, et al.
·
Lecture notes in computer science
·
63
Quantum error detection .II. Bounds
2000
·
A.E. Ashikhmin
, A.M. Barg
, et al.
·
IEEE Transactions on Information Theory
·
60
PDF
Magic Graphs
2012
·
Alison M. Marr
, W.D. Wallis
·
Springer eBooks
·
58
3.1 n − o ( n ) circuit lower bounds for explicit functions
2022
·
Jiatu Li
, Tianqi Yang
·
ACM Symposium on Theory of Computing (STOC)
·
54
PDF
Estimates of the coverage of parameter space by Latin Hypercube and Orthogonal Array-based sampling
2017
·
D. Donovan
, K. Burrage
, et al.
·
Applied Mathematical Modelling
·
54
PDF
Proofs that count
2014
·
Azadeh Farzan
, Zachary Kincaid
, et al.
·
ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)
·
49
Show more works
View as search
Works count:
446
Citation count:
10,540
Year
Topic
Type