Article

Free access

On the method of approximations

Author:

A. A. RazborovAuthors Info & Claims

STOC '89: Proceedings of the twenty-first annual ACM symposium on Theory of computing

Pages 167 - 176

https://doi.org/10.1145/73007.73023

Published: 01 February 1989 Publication History

PDF eReader

References

[1]

N. Alon and R. Boppana. The monotone circuit complexity of boolean functions. Combinatorica, 7(1)'1-22, 1987.

Digital Library

Google Scholar

[2]

Andreev A. E. On a method for obtaining lower bounds for the complexity of individual monotone functions. Doklady Akademii Nauk, 282(5)'1033-1037, 1985. English translation in: Soviet Mathematics Doklady 31:3, 530-534.

Google Scholar

[3]

M. Ajtai, J. Komlos, and E. Szemeredi. An 0(nlogn) sorting network. In Proceedings of the 15tn Annual A CM Symposium on Theory of Computing, Boston, Massachusetts, pages 1-9, ACM SIGACT, ACM, 1983.

Digital Library

Google Scholar

[4]

A. E. Andreev. On one method of obtaining constructive lower bounds for the monotone circuit size. Algebra and Logics, 26(1)'3-26, 1987.

Google Scholar

[5]

R. Boppana and M. Sipser. Complexity of finite functions. Cambridge, USA, 1988. preprint.

Google Scholar

[6]

M. Paterson. Bounded depth circuits over {&, $}. Warwick, Britain, 1986. preprint.

Google Scholar

[7]

A. A. Razborov. A lower bound on the monotone network complexity of the logical permanent. Mathematicheskie gametki, 37(6)'887-900, 1985. English translation in: 2(athematical Notes of the Academy of Sciences of the USSR 37:6,485-493.

Google Scholar

[8]

A. A. Razborov. Lower bounds on the monotone complexity of some boolean functions. Doklady Akademii Naul:, 281(4) 798- 801, 1985. English translation in: Soviet Mathematics Doklady 31,354- 357.

Google Scholar

[9]

A.A. Razborov. Lower bounds for the monotone complexity of boolean functions. In Proceedings of the International Congress of Mathematicians, pages 1478-1487, Berkeley, California, 1986.

Google Scholar

[10]

A.A. Razborov. Lower bounds on the size of bounded depth networks over a complete basis with logical addition. Mathematicheskie Zametki, 41 (4)'598-607, 1987. English translation in: Mathematical Notes of the Academy of Sciences of the USSR 41:4, 333-338.

Crossref

Google Scholar

[11]

R. Smolensky. Algebraic methods in the theory of lower bounds for boolean circuit complexity. Ill Proceedings of the 19th Annual A CM Symposium on Theory of Computing, New York City, pages 77-82, ACM SIGACT, ACM, 1987.

Digital Library

Google Scholar

[12]

Eva Tardos. The gap between monotone and non-monotone circuit complexity is exponenial. 1989. to appear in Combinatorica.

Google Scholar

Cited By

View all

Pich J(2024)Localizability of the approximation methodcomputational complexity10.1007/s00037-024-00257-033:2Online publication date: 5-Sep-2024
https://doi.org/10.1007/s00037-024-00257-0
Heal MDashtipour KGogate M(2023)The P vs. NP Problem and Attempts to Settle It via Perfect Graphs State-of-the-Art ApproachAdvances in Information and Communication10.1007/978-3-031-28073-3_23(328-340)Online publication date: 2-Mar-2023
https://doi.org/10.1007/978-3-031-28073-3_23
Makam VWigderson A(2020)Symbolic determinant identity testing (SDIT) is not a null cone problem; and the symmetries of algebraic varieties2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS46700.2020.00086(881-888)Online publication date: Nov-2020
https://doi.org/10.1109/FOCS46700.2020.00086
Show More Cited By

Index Terms

On the method of approximations
1. Mathematics of computing
  1. Discrete mathematics
    1. Combinatorics
      1. Generating functions
    2. Graph theory
      1. Graph algorithms
  2. Mathematical analysis
    1. Functional analysis
      1. Approximation
2. Theory of computation
  1. Computational complexity and cryptography
    1. Complexity classes
  2. Design and analysis of algorithms
    1. Approximation algorithms analysis

Recommendations

Optimal convergence of minimum norm approximations inHp

Let 1< p , and let H _p (U) denote the family of all functions f that are analytic in the unit disc U such that $$\parallel f\parallel _p = \mathop {\lim }\limits_{r \to 1^ - } \left( {\frac{1}{{2\pi }}\int\limits_0^{2\pi } {|f(re^{i\theta }...
On Multiplicative $\lambda$-Approximations and Some Geometric Applications
^† Special Section on the Forty-Second Annual ACM Symposium on Theory of Computing (STOC 2010)

Let $\mathcal{F}$ be a set system over an underlying finite set $X$, and let $\mu$ be a nonnegative measure over $X$; i.e., for every $S \subseteq X$, $\mu(S)=\sum_{x\in S} \mu(x)$. A measure $\mu^*$ on $X$ is called a multiplicative ${\lambda}$-...
Diffusion approximations for recursive stochastic algorithms

Comments

Information & Contributors

Information

Published In

STOC '89: Proceedings of the twenty-first annual ACM symposium on Theory of computing

February 1989

600 pages

ISBN:0897913078

DOI:10.1145/73007

Editor:
D. S. Johnson

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 February 1989

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC89

Sponsor:

SIGACT

STOC89: 21st Annual ACM Symposium on the Theory of Computing

May 14 - 17, 1989

Washington, Seattle, USA

Acceptance Rates

STOC '89 Paper Acceptance Rate 56 of 196 submissions, 29%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

45
Total Citations
View Citations
541
Total Downloads

Downloads (Last 12 months)72
Downloads (Last 6 weeks)17

Reflects downloads up to 01 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Pich J(2024)Localizability of the approximation methodcomputational complexity10.1007/s00037-024-00257-033:2Online publication date: 5-Sep-2024
https://doi.org/10.1007/s00037-024-00257-0
Heal MDashtipour KGogate M(2023)The P vs. NP Problem and Attempts to Settle It via Perfect Graphs State-of-the-Art ApproachAdvances in Information and Communication10.1007/978-3-031-28073-3_23(328-340)Online publication date: 2-Mar-2023
https://doi.org/10.1007/978-3-031-28073-3_23
Makam VWigderson A(2020)Symbolic determinant identity testing (SDIT) is not a null cone problem; and the symmetries of algebraic varieties2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS46700.2020.00086(881-888)Online publication date: Nov-2020
https://doi.org/10.1109/FOCS46700.2020.00086
Bafna MSrinivasan SSudan M(2020)Local decoding and testing of polynomials over gridsRandom Structures & Algorithms10.1002/rsa.2093357:3(658-694)Online publication date: 27-Jun-2020
https://doi.org/10.1002/rsa.20933
Limaye NSreenivasaiah KSrinivasan STripathi UVenkitesh SCharikar MCohen E(2019)A fixed-depth size-hierarchy theorem for AC0[⊕] via the coin problemProceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing10.1145/3313276.3316339(442-453)Online publication date: 23-Jun-2019
https://dl.acm.org/doi/10.1145/3313276.3316339
Garg AGöös MKamath PSokolov DDiakonikolas IKempe DHenzinger M(2018)Monotone circuit lower bounds from resolutionProceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3188745.3188838(902-911)Online publication date: 20-Jun-2018
https://dl.acm.org/doi/10.1145/3188745.3188838
Rossman BZuckerman D(2015)Correlation bounds against monotone NCProceedings of the 30th Conference on Computational Complexity10.5555/2833227.2833247(392-411)Online publication date: 17-Jun-2015
https://dl.acm.org/doi/10.5555/2833227.2833247
Segerlind N(2014)The Complexity of Propositional ProofsBulletin of Symbolic Logic10.2178/bsl/120335087913:4(417-481)Online publication date: 15-Jan-2014
https://doi.org/10.2178/bsl/1203350879
Williams R(2014)Nonuniform ACC Circuit Lower BoundsJournal of the ACM10.1145/255990361:1(1-32)Online publication date: 1-Jan-2014
https://dl.acm.org/doi/10.1145/2559903
Razborov A(2013)On Small Size Approximation ModelsThe Mathematics of Paul Erdős I10.1007/978-1-4614-7258-2_26(425-433)Online publication date: 20-May-2013
https://doi.org/10.1007/978-1-4614-7258-2_26
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Optimal convergence of minimum norm approximations inHp

On Multiplicative $\lambda$-Approximations and Some Geometric Applications

Diffusion approximations for recursive stochastic algorithms