article

Free access

Some Exact Complexity Results for Straight-Line Computations over Semirings

Authors:

Mark Jerrum,

Marc SnirAuthors Info & Claims

Journal of the ACM (JACM), Volume 29, Issue 3

Pages 874 - 897

https://doi.org/10.1145/322326.322341

Published: 01 July 1982 Publication History

PDF eReader

References

[1]

AHO, A V, HOPCROFT, J E, AND ULLMAN, J D The Design and Analysis of Computer Algorithms. Addison Wesley, Readmg, Mass, 1974

Crossref

Google Scholar

[2]

BORODIN, A, AND MUNRO, 1 The Complexity of Algebraic and Numerical Problems American Elsevier, New York, 1974.

Google Scholar

[3]

CUNtNGHAME-GREEN, R. Minimax Algebra Spnnger-Veflag, Berhn, 1979.

Google Scholar

[4]

EHRENFEUCHT, A, AND ZEIGER, P Complexity measures for regular expressions Proc. 6th ACM Symp on Theory of Computing, Seattle, Wash, 1974, pp 75-79

Crossref

Google Scholar

[5]

FAN, K On systems of hnear mequahtaes In Linear lnequahttes and Related Systems, H W. Kuhn and A W Tucker, Eds, Princeton Umverslty Press, Princeton, N J, 1956, pp. 99-156.

Google Scholar

[6]

GOODRICH, G B, LADNER, R E., AND FISHER, M J Straight-hue programs to compute fimte languages Proc Conf. on Theoreucal Computer Science, Waterloo, Ontario, Canada, 1977, pp 221-229.

Google Scholar

[7]

LAMAGNA, E A, AND SAVAGE, J.E Combmatoria! complexity of some monotone funcUons Proc 15th iEEE Syrup on Switching and Automata Theory, New Orleans, La, 1974, pp 140-144.

Google Scholar

[8]

L~WLER, E L Combinatorial OpamLsaUon. Networks and Matrotds. Holt, Rmehart arm Winston, New York, 1976

Google Scholar

[9]

LEE, S C Modern Switching Theory Prentice Hall, Englewood Cliffs, N J, 1978.

Google Scholar

[10]

MEHLHORN, K, AND GALIL, Z Monotone switching circuits and Boolean matrix product Comput. ~6 (1976), 99-ttt

Google Scholar

[11]

MILLER, W Computer search for numerical instability J ACM 22, 4 (Oct 1975), 512-521.

Crossref

Google Scholar

[12]

MINC, H Permanents, Encyclopedia of Mathemaucs and its Apphcations, 6. Addison-Wesley, Reading Mass, 1978

Google Scholar

[13]

MooN, J W Counnng Labelled Trees. Canadian Mathematical Congress, Montreal, 1970

Google Scholar

[14]

NIJENHUIS, A, AND WILF, H S. Combinatorial Algorithms Academic Press, New York, 1975.

Google Scholar

[15]

PATERSON, M S Complexity of monotone networks for Boolean matrix product Theor Comput. Set 1 (1975), 13-20

Google Scholar

[16]

PRATT, V R The power of negative thinking jn muluplymg Boolean matrices SIAM ~ Con,put 4 (1975), 326-330.

Google Scholar

[17]

REDEI, L Algebra, Vol l Pergamon Press, Oxford, 1967

Google Scholar

[18]

SCHNORR, C P A lower bound on the number of addmons in monotone computations Theor. Comput Sct 2 (1976), 305-315.

Google Scholar

[19]

SCHONFIAGE, A Partial and total matrtx rnuktphcatton Manuscript, Mathemaasches lnstitut, Unlversitat Tubmgen, Tubmgen, Germany

Google Scholar

[20]

SHAMIR, E, AND SNIR, M.Lower bounds on the number of muluphcations and the number of addmons in monotone computations Tech Pep RC 6757, IBM Thomas J. Watson Research Center, Yorktown Heights, N Y, 1977

Google Scholar

[21]

SUAMIV, E, ~.1,~ Stem, M Or, the depdl complexity of formulas To appear tn Math Syst. Theory.

Google Scholar

[22]

SNIR, M On the s~ze complexity of monotone formulas Tech Pep CSR-46-79, Univ. of Edinburgh, Edinburgh, Scotland, 1979 Also presented at the 7th lnt Colloq on Automata, Language and Programming, Noordwijkerhout, Holland, July 1980.

Crossref

Google Scholar

[23]

STRASSEN, V Vermeldung yon dwlstonen J Reme Angew Math 264 (1973), 182-202.

Google Scholar

[24]

STRASSEN, V Berechnung un program I1 Acta Inf 2 (1973), 64-79

Google Scholar

[25]

VALIAN~r, L G The complexity of computing the permanent Theor Comput Sci 8 (1979), 189-201

Google Scholar

[26]

VALIANT, L G Completeness classes m algebra Proc I lth ACM Syrup on Theory of Computing, Atlanta, Ga, 1979, pp 249-26t

Crossref

Google Scholar

[27]

VALIANT, L G.Negauon can be exponentially powerful. Proc. {lth ACM Synlp. on Theory of Computing, Atlanta, Ga, 1979, pp 189-196

Crossref

Google Scholar

[28]

WEGENER, Sitching functions whose monotone complexity ts nearly quadratic Theor Comput Sc~ 9 (1979), 83-87,

Google Scholar

[29]

WEGENER, I A counterexample to a conjecture of Schnorr referring to monotone networks Theor Comput Sc~ 9 (1979), 147-150

Google Scholar

Cited By

View all

Jukna S(2025) Notes on Boolean read- and multilinear circuits Discrete Applied Mathematics10.1016/j.dam.2024.09.023360(307-327)Online publication date: Jan-2025
https://doi.org/10.1016/j.dam.2024.09.023
Fournier HLimaye NSrinivasan STavenas SMohar BShinkar IO'Donnell R(2024)On the Power of Homogeneous Algebraic FormulasProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649760(141-151)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649760
Chatterjee PGajjar KTengse A(2024)Monotone classes beyond VNPTheoretical Computer Science10.1016/j.tcs.2024.1146891009:COnline publication date: 12-Sep-2024
https://dl.acm.org/doi/10.1016/j.tcs.2024.114689
Show More Cited By

Index Terms

Some Exact Complexity Results for Straight-Line Computations over Semirings
1. Theory of computation

Recommendations

Kolmogorov Complexity for Possibly Infinite Computations

In this paper we study the Kolmogorov complexity for non-effective computations, that is, either halting or non-halting computations on Turing machines. This complexity function is defined as the length of the shortest input that produce a desired ...
Inductive *-semirings
Words, languages and combinatorics

One of the most well-known induction principles in computer science is the fixed point induction rule, or least pre-fixed point rule. Inductive ^*-semirings are partially ordered semirings equipped with a star operation satisfying the fixed point ...
Equational theories of tropical semirings
Foundations of software science and computation structures

This paper studies the equational theories of various exotic semirings presented in the literature. Exotic semirings are semirings whose underlying carrier set is some subset of the set of real numbers equipped with binary operations of minimum or ...

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 29, Issue 3

July 1982

302 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/322326

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1982

Published in JACM Volume 29, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

81
Total Citations
View Citations
967
Total Downloads

Downloads (Last 12 months)174
Downloads (Last 6 weeks)22

Reflects downloads up to 06 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Jukna S(2025) Notes on Boolean read- and multilinear circuits Discrete Applied Mathematics10.1016/j.dam.2024.09.023360(307-327)Online publication date: Jan-2025
https://doi.org/10.1016/j.dam.2024.09.023
Fournier HLimaye NSrinivasan STavenas SMohar BShinkar IO'Donnell R(2024)On the Power of Homogeneous Algebraic FormulasProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649760(141-151)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649760
Chatterjee PGajjar KTengse A(2024)Monotone classes beyond VNPTheoretical Computer Science10.1016/j.tcs.2024.1146891009:COnline publication date: 12-Sep-2024
https://dl.acm.org/doi/10.1016/j.tcs.2024.114689
Hertrich CSering L(2024)ReLU neural networks of polynomial size for exact maximum flow computationMathematical Programming10.1007/s10107-024-02096-xOnline publication date: 25-May-2024
https://doi.org/10.1007/s10107-024-02096-x
Hrubeš PYehudayoff A(2023)Shadows of Newton polytopesIsrael Journal of Mathematics10.1007/s11856-023-2510-z256:1(311-343)Online publication date: 10-Oct-2023
https://doi.org/10.1007/s11856-023-2510-z
Komarath BPandey ARahul C(2023)Monotone Arithmetic Complexity of Graph Homomorphism PolynomialsAlgorithmica10.1007/s00453-023-01108-085:9(2554-2579)Online publication date: 11-Mar-2023
https://dl.acm.org/doi/10.1007/s00453-023-01108-0
Jukna SJukna S(2023)Rectangle BoundsTropical Circuit Complexity10.1007/978-3-031-42354-3_3(53-76)Online publication date: 11-Aug-2023
https://doi.org/10.1007/978-3-031-42354-3_3
Jukna SJukna S(2023)Combinatorial BoundsTropical Circuit Complexity10.1007/978-3-031-42354-3_2(39-52)Online publication date: 11-Aug-2023
https://doi.org/10.1007/978-3-031-42354-3_2
Jukna SJukna S(2023)BasicsTropical Circuit Complexity10.1007/978-3-031-42354-3_1(1-38)Online publication date: 11-Aug-2023
https://doi.org/10.1007/978-3-031-42354-3_1
Hertrich CSering L(2023)ReLU Neural Networks of Polynomial Size for Exact Maximum Flow ComputationInteger Programming and Combinatorial Optimization10.1007/978-3-031-32726-1_14(187-202)Online publication date: 21-Jun-2023
https://dl.acm.org/doi/10.1007/978-3-031-32726-1_14
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.

References

Cited By

Index Terms

Recommendations

Kolmogorov Complexity for Possibly Infinite Computations

Inductive *-semirings

Equational theories of tropical semirings

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations