{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T23:49:44Z","timestamp":1785973784343,"version":"3.56.0"},"reference-count":28,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1979,1,1]],"date-time":"1979-01-01T00:00:00Z","timestamp":283996800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":12616,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1979]]},"DOI":"10.1016\/0304-3975(79)90044-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"189-201","source":"Crossref","is-referenced-by-count":1716,"title":["The complexity of computing the permanent"],"prefix":"10.1016","volume":"8","author":[{"given":"L.G.","family":"Valiant","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(79)90044-6_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(79)90044-6_BIB2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/1811123.1811124","article-title":"A note on disjunctive form tautologies","volume":"52","author":"Bauer","year":"1973","journal-title":"SIGACT News"},{"key":"10.1016\/0304-3975(79)90044-6_BIB3","first-page":"151","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971","journal-title":"Proc. 3rd ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(79)90044-6_BIB4","first-page":"91","article-title":"Computational complexity of probabilistic Turing machines","author":"Gill","year":"1974","journal-title":"Proc. 6th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(79)90044-6_BIB5","doi-asserted-by":"crossref","first-page":"716","DOI":"10.2307\/2309562","article-title":"An algorithm for distinct representatives","volume":"63","author":"Hall","year":"1956","journal-title":"Am. Math. Monthly"},{"key":"10.1016\/0304-3975(79)90044-6_BIB6","series-title":"Graphical Enumeration","author":"Harary","year":"1973"},{"key":"10.1016\/0304-3975(79)90044-6_BIB7","series-title":"An Introduction to the Theory of Numbers","author":"Hardy","year":"1960"},{"key":"10.1016\/0304-3975(79)90044-6_BIB8","first-page":"30","article-title":"On Isomorphisms and density of NP and other complete sets","author":"Hartmanis","year":"1976","journal-title":"Proc. 8th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(79)90044-6_BIB9","series-title":"MAC TR-113","article-title":"On reducibility among combinatorial problems","author":"Herrmann","year":"1973"},{"key":"10.1016\/0304-3975(79)90044-6_BIB10","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An n52 algorithm for maximum matchings in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(79)90044-6_BIB11","series-title":"Complexity of Computer Computations","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"issue":"B","key":"10.1016\/0304-3975(79)90044-6_BIB12","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0095-8956(75)90048-9","article-title":"A characterization of convertible (0, 1)-matrices","volume":"18","author":"Little","year":"1975","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0304-3975(79)90044-6_BIB13","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1215\/ijm\/1255630882","article-title":"On the relation between the determinant and the permanent","volume":"5","author":"Marcus","year":"1961","journal-title":"Illinois J. Math."},{"key":"10.1016\/0304-3975(79)90044-6_BIB14","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1109\/SWAT.1972.29","article-title":"The equivalence problem for regular expressions with squaring requires exponential space","author":"Meyer","year":"1972","journal-title":"Proc. 13th Symp. on Switching and Automata Theory"},{"key":"10.1016\/0304-3975(79)90044-6_BIB15","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1017\/S0370164600047593","article-title":"On a class of permanent symmetric functions","volume":"11","author":"Muir","year":"1882","journal-title":"Proc. Roy. Soc. Edinburgh"},{"issue":"3","key":"10.1016\/0304-3975(79)90044-6_BIB16","first-page":"27","article-title":"Aufgabe 424","volume":"20","author":"Polya","year":"1913","journal-title":"Arch. Math. Phys."},{"key":"10.1016\/0304-3975(79)90044-6_BIB17","article-title":"Combinatorial Mathematics","author":"Ryser","year":"1963","journal-title":"Carus Math. Monograph no. 14"},{"key":"10.1016\/0304-3975(79)90044-6_BIB18","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0304-3975(76)90083-9","article-title":"A lower bound on the number of additions in monotone computations","volume":"2","author":"Schnorr","year":"1976","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/0304-3975(79)90044-6_BIB19","series-title":"Ph.D. Thesis","article-title":"On some central problems in computational complexity","author":"Simon","year":"1975"},{"key":"10.1016\/0304-3975(79)90044-6_BIB20","article-title":"On the difference between one and many","author":"Simon","year":"1977","journal-title":"Proc. 4th Colloq. on Automata, Languages and Programming"},{"key":"10.1016\/0304-3975(79)90044-6_BIB21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(79)90044-6_BIB22","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF02165411","article-title":"Gaussian elimination is not optimal","volume":"13","author":"Strassen","year":"1969","journal-title":"Numer. Math."},{"key":"10.1016\/0304-3975(79)90044-6_BIB23","series-title":"A polynomial reduction of satisfiability to Hamiltonian circuits that preserves the number of solutions","author":"Valiant","year":"1974"},{"issue":"1","key":"10.1016\/0304-3975(79)90044-6_BIB24","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/0020-0190(76)90097-1","article-title":"The relative complexity of checking and evaluating","volume":"5","author":"Valiant","year":"1976","journal-title":"Information Processing Lett."},{"key":"10.1016\/0304-3975(79)90044-6_BIB25","doi-asserted-by":"crossref","unstructured":"L.G. Valiant, The complexity of enumeration and reliability problems, SIAM J. Comput. (to appear).","DOI":"10.1137\/0208032"},{"key":"10.1016\/0304-3975(79)90044-6_BIB26","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.1976.1055638","article-title":"New directions is cryptography","author":"Diffie","year":"1976","journal-title":"IEEE. Trans Information Theory"},{"key":"10.1016\/0304-3975(79)90044-6_BIB27","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1137\/0204018","article-title":"Every prime has a succint certificate","volume":"4","author":"Pratt","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(79)90044-6_BIB28","series-title":"TM 82","article-title":"On digital signatures and public-key cryptosystems","author":"Rivest","year":"1977"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397579900446?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397579900446?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T06:32:28Z","timestamp":1580884348000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397579900446"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1979]]}},"alternative-id":["0304397579900446"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(79)90044-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1979]]}}}