乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T16:39:36Z","timestamp":1719938376289},"reference-count":34,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"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":6803,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1016\/0012-365x(94)00115-y","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:34Z","timestamp":1027640614000},"page":"253-279","source":"Crossref","is-referenced-by-count":24,"title":["Some combinatorial-algebraic problems from complexity theory"],"prefix":"10.1016","volume":"136","author":[{"given":"P.","family":"Pudl\u00e1k","sequence":"first","affiliation":[]},{"given":"V.","family":"R\u00f6dl","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(94)00115-Y_BIB1","first-page":"133","article-title":"On the notion of information transfer in VLSI circuits","author":"Aho","year":"1983","journal-title":"Proc. 15th ACM STOC"},{"key":"10.1016\/0012-365X(94)00115-Y_BIB2","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/0097-3165(80)90030-8","article-title":"A note on Ramsey numbers","volume":"29","author":"Ajtai","year":"1980","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0012-365X(94)00115-Y_BIB3","author":"Alon","year":"1990","journal-title":"On the rigidity of Hadamard matrices"},{"key":"10.1016\/0012-365X(94)00115-Y_BIB4","first-page":"544","article-title":"Simple constructions of almost k-wise independent random variables","author":"Alon","year":"1990","journal-title":"Proc. 31st IEEE FOCS"},{"issue":"6","key":"10.1016\/0012-365X(94)00115-Y_BIB5","doi-asserted-by":"crossref","first-page":"1064","DOI":"10.1137\/0219074","article-title":"Linear circuits over GF2","volume":"19","author":"Alon","year":"1990","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/0012-365X(94)00115-Y_BIB6","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1002\/jgt.3190130413","article-title":"A counterexample to the rank-coloring conjecture","volume":"13","author":"Alon","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(94)00115-Y_BIB7","first-page":"277","article-title":"Geometric realizations of set systems and probabilistic communication complexity","author":"Alon","year":"1985","journal-title":"Proc. 26th IEEE FOCS"},{"key":"10.1016\/0012-365X(94)00115-Y_BIB8","first-page":"337","article-title":"Complexity classes in communication complexity theory","author":"Babai","year":"1986","journal-title":"Proc. 27th IEEE FOCS"},{"key":"10.1016\/0012-365X(94)00115-Y_BIB9","article-title":"Subspace arrangements","author":"Bj\u00f6rner","year":"1992","journal-title":"Proc. 1st European Congress of Mathematics"},{"key":"10.1016\/0012-365X(94)00115-Y_BIB10","doi-asserted-by":"crossref","first-page":"233","DOI":"10.6028\/jres.071B.032","article-title":"System of distinct representatives and linear algebra","volume":"B71","author":"Edmonds","year":"1967","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"10.1016\/0012-365X(94)00115-Y_BIB11","author":"Friedman","year":"1990","journal-title":"A note on matrix rigidity"},{"key":"10.1016\/0012-365X(94)00115-Y_BIB12","first-page":"102","author":"Karchmer","year":"1993","journal-title":"On span programs, Proc. 8th annual Symp. on Structure in Complexity Theory"},{"key":"10.1016\/0012-365X(94)00115-Y_BIB13","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1109\/SCT.1991.160275","article-title":"Geometric arguments yield better bounds for threshold circuits and distributed computing","author":"Krause","year":"1991","journal-title":"Proc. 6th IEEE Structure in Complexity Theory Conf."},{"key":"10.1016\/0012-365X(94)00115-Y_BIB14","first-page":"45","article-title":"Flats in matroids and geometric graphs","author":"Lov\u00e1sz","year":"1977"},{"key":"10.1016\/0012-365X(94)00115-Y_BIB15","first-page":"81","article-title":"Lattices, M\u00f6bius functions and communication complexity","author":"Lov\u00e1sz","year":"1988","journal-title":"Proc. 29th IEEE FOCS"},{"key":"10.1016\/0012-365X(94)00115-Y_BIB16","author":"MacWilliams","year":"1992"},{"key":"10.1016\/0012-365X(94)00115-Y_BIB17","first-page":"330","article-title":"Las Vegas is better than determinism in VLSI and distributed computing","author":"Mehlhorn","year":"1982","journal-title":"Proc. 14th ACM STOC"},{"key":"10.1016\/0012-365X(94)00115-Y_BIB18","first-page":"118","article-title":"Probabilistic communication complexity","author":"Paturi","year":"1984","journal-title":"Proc. 25th IEEE FOCS"},{"key":"10.1016\/0012-365X(94)00115-Y_BIB19","unstructured":"S. Poljak and V. R\u00f6dl, Ranking of tournaments, unpublished manuscript."},{"issue":"4","key":"10.1016\/0012-365X(94)00115-Y_BIB20","doi-asserted-by":"crossref","first-page":"1137","DOI":"10.1090\/S0002-9939-1989-0963575-5","article-title":"Maximum rank of powers of a matrix of a given pattern","volume":"106","author":"Poljak","year":"1989","journal-title":"Proc. AMS"},{"key":"10.1016\/0012-365X(94)00115-Y_BIB21","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF01215351","article-title":"Communication in bounded depth circuits","volume":"14","author":"Pudl\u00e1k","year":"1994","journal-title":"Combinatorica"},{"issue":"2","key":"10.1016\/0012-365X(94)00115-Y_BIB22","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF01204724","article-title":"A combinatorial approach to complexity","volume":"12","author":"Pudl\u00e1k","year":"1992","journal-title":"Combinatorica"},{"key":"10.1016\/0012-365X(94)00115-Y_BIB23","first-page":"523","article-title":"Modified ranks of tensors and the size of circuits","author":"Pudl\u00e1k","year":"1993","journal-title":"Proc. 25th STOC"},{"issue":"2","key":"10.1016\/0012-365X(94)00115-Y_BIB24","first-page":"213","article-title":"Computation of rigidity of order n2\/r for one simple matrix","volume":"32","author":"Pudl\u00e1k","year":"1991","journal-title":"Comment. Math. Univ. Carolina"},{"key":"10.1016\/0012-365X(94)00115-Y_BIB25","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/0012-365X(92)90691-8","article-title":"The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear","volume":"108","author":"Razborov","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)00115-Y_BIB26","unstructured":"A.A. Razborov, On rigid matrices, preprint (in Russian)."},{"key":"10.1016\/0012-365X(94)00115-Y_BIB27","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF02122698","article-title":"Applications of matrix methods for the theory of lower bounds in computational complexity","volume":"10","author":"Razborov","year":"1990","journal-title":"Combinatorica"},{"key":"10.1016\/0012-365X(94)00115-Y_BIB28","first-page":"378","article-title":"Lower bounds for polynomial evaluation and interpolation problems","author":"Shoup","year":"1991","journal-title":"Proc. 32nd IEEE FOCS"},{"key":"10.1016\/0012-365X(94)00115-Y_BIB29","first-page":"162","article-title":"Graph-theoretic arguments in low level complexity","author":"Valiant","year":"1977"},{"key":"10.1016\/0012-365X(94)00115-Y_BIB30","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1090\/S0002-9947-1968-0226281-1","article-title":"Lower bounds for approximations by nonlinear manifolds","volume":"133","author":"Warren","year":"1968","journal-title":"Trans. AMS"},{"key":"10.1016\/0012-365X(94)00115-Y_BIB31","author":"Wegener","year":"1987"},{"key":"10.1016\/0012-365X(94)00115-Y_BIB32","first-page":"209","article-title":"Some complexity questions related to distributive computing","author":"Yao","year":"1979","journal-title":"Proc. 11th ACM STOC"},{"key":"10.1016\/0012-365X(94)00115-Y_BIB33","article-title":"On Rank vs. Communication Complexity","author":"Nisan","year":"1994","journal-title":"Proc. of the 33rd IEEE Symp. FOCS"},{"key":"10.1016\/0012-365X(94)00115-Y_BIB34","first-page":"168","article-title":"On the Log-Rank conjecture in communication complexity","author":"Raz","year":"1993","journal-title":"Proc. of the 34th IEEE Symp. FOCS"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400115Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400115Y?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:01:40Z","timestamp":1580882500000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9400115Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":34,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["0012365X9400115Y"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)00115-y","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}