[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"_public_publisher_all{\"sortAscending\":false,\"sortField\":\"updateTime\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"\"}":3,"_public_publisher_byId_2bf7737b-5f9c-4b74-b81e-dd84d16d8989":656,"_public_publication_all{\"sortAscending\":false,\"sortField\":\"totalCitation\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"publisherId:2bf7737b-5f9c-4b74-b81e-dd84d16d8989,\"}":772},{"meta":4,"data":6},{"total":5},"117",[7,60,176,207,299,413,445,480,543,572],{"id":8,"createTime":9,"updateTime":10,"relativeEntities":11,"slug":12,"properties":13,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":27,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":29,"subjectFields":30,"manageAffiliations":31,"indexDatabases":32,"url":33,"thumbnailPath":34,"statistic":35,"gsStatistic":26,"type":26,"analyzePriority":26},"5a09599f-54d1-44c3-8f16-3847ac552024","2023-08-17T04:28:50.832+00:00","2025-10-13T23:58:52.517+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Truy%E1%BB%81n-nhi%E1%BB%85m-Vi%E1%BB%87t-Nam",{"country":14,"issn":16,"introduce":18,"title":21},{"VOID":15},"VN",{"VOID":17},"08667829",{"EN":19,"VI":20},"{\"ops\":[{\"insert\":\"Vietnam Journal of Infectious Diseases is a social - professional forum of the Vietnam Society for Infectious Diseases, whose responsibility is to introduce the researches, the scientific advances in Vietnam and from the world; to contribute to the improvement of knowledges for health care staffs about clinic, treatment, guideline, prevention, epidemiology for infectious diseases, HIV\u002FAIDS and community health care; to provide, exchange and publish scientific information to the public accurately and promptly.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Vietnam Journal of Infectious Diseases publishes in the whole country; serves the professional work for researchers, clinical staffs, administrators, undergraduate and postgraduate students who are working and studying in the infections, tropical diseases and HIV\u002FAIDS from central to local levels, also organizations and individuals in the world who are interested in infectious and tropical diseases and prevention for HIV\u002FAIDS.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Editor in Chief:\"},{\"attributes\":{\"header\":4},\"insert\":\"\\n\"},{\"insert\":\"Prof. Dr. Nguyen Van Kinh. - Chairman of Editorial Board\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"insert\":\"Prof. Dr. Nguyen Van Mui.\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Headquarter:\"},{\"attributes\":{\"header\":4},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Address:\"},{\"insert\":\" Level 6, National Hospital for Tropical Diseases, No. 78 Giai Phong Street, Dong Da District, Hanoi city, Vietnam.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Tel:\"},{\"insert\":\" \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:02435765464\"},\"insert\":\"02435765464\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:0913552672\"},\"insert\":\"0913552672\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:0913228072\"},\"insert\":\"0913228072\"},{\"insert\":\".\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Email\"},{\"insert\":\": \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Findex\u002Fadmin\u002Fcontexts\u002Fmailto:tungphamvan52@gmail.com\"},\"insert\":\"tungphamvan52@gmail.com\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Fmailto:tapchitruyennhiem@gmail.com\"},\"insert\":\"tapchitruyennhiem@gmail.com\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Bank account:\"},{\"insert\":\" 0021000275119, Vietcombank Hanoi Branch. Transaction office No. 7, 402 Tran Khat Chan, Hai Ba Trung District, Hanoi city, Vietnam.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}","{\"ops\":[{\"insert\":\"Tạp chí Truyền nhiễm Việt Nam là cơ quan ngôn luận của Hội Truyền nhiễm Việt Nam, chịu sự lãnh đạo, chỉ đạo trực tiếp của Thường vụ Ban Chấp hành Hội Truyền nhiễm Việt Nam; sự kiểm tra, giám sát về nghiệp vụ báo chí của các cơ quan chức năng quản lý báo chí thuộc Bộ Thông tin và Truyền thông và Ban Tuyên giáo Trung ương Đảng.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Tạp chí có trách nhiệm giới thiệu các công trình nghiên cứu khoa học, những tiến bộ khoa học trên thế giới và trong nước, góp phần nâng cao kiến thức khoa học cho cán bộ y tế về lâm sàng, điều trị, hướng dẫn, dự phòng, dịch tễ học các bệnh truyền nhiễm, HIV\u002FAIDS và chăm sóc sức khỏe cộng đồng; cung cấp, trao đổi, phổ biến các thông tin khoa học tới công chúng chính xác và kịp thời.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Tạp chí xuất bản 03 tháng\u002F01 kỳ và được phát hành qua Bưu điện và tự phát hành trong phạm vi toàn quốc.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Lãnh đạo Tạp chí: \"},{\"attributes\":{\"header\":4},\"insert\":\"\\n\"},{\"insert\":\"Tổng Biên tập: ThS.BSCKII Nguyễn Trung Cấp\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"insert\":\"Phó Tổng Biên tập:\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"insert\":\"            TS.BSCKII Phạm Ngọc Thạch\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Trụ sở tòa soạn:\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Địa chỉ: Tầng 6, Bệnh viện Bệnh Nhiệt đới Trung ương, 78 đường Giải Phóng, phường Phương Mai, quận Đống Đa, thành phố Hà Nội.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Điện thoại:\"},{\"insert\":\" \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:02435765464\"},\"insert\":\"02435765464\"},{\"insert\":\" - \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:0913228072\"},\"insert\":\"0913228072\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Email\"},{\"insert\":\": \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Findex\u002Fadmin\u002Fcontexts\u002Fmailto:tungphamvan52@gmail.com\"},\"insert\":\"tungphamvan52@gmail.com\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Fmailto:tapchitruyennhiem@gmail.com\"},\"insert\":\"tapchitruyennhiem@gmail.com\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Tài khoản:\"},{\"insert\":\" Số 0021000275119 Ngân hàng Ngoại thương Việt Nam, chi nhánh Hà Nội (Vietcombank Hà Nội). Phòng giao dịch số 7, 402 Trần Khát Chân, quận Hai Bà Trưng, Thành phố Hà Nội.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}",{"EN":22,"VI":23},"Vietnam Journal of Infectious Diseases","Tạp chí Truyền nhiễm Việt Nam","PUBLISHER","VERIFIED",null,"Admin update database","PENDING",51,[],[],[],"https:\u002F\u002Ftruyennhiemvietnam.vn\u002Findex.php\u002Fvjid","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F5a09599f-54d1-44c3-8f16-3847ac552024\u002Fadb0e52bf25e0de580fd4289519cb8bf.jpg",{"impactFactor":36,"impactFactorByYear":37,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":41,"totalPublicationByYear":42,"totalCitation":48,"totalCitationByYear":49,"totalCitationPerPublication":54,"totalCitationPerPublicationByYear":55,"hindexLast5Year":59,"hindex":59},0,{"2022":38,"2023":39,"2024":40},0.01,0.03,0.13,315,{"2020":43,"2021":44,"2022":45,"2023":46,"2024":47},63,58,57,65,72,43,{"2020":50,"2021":51,"2022":52,"2023":53},8,15,9,11,0.14,{"2020":40,"2021":56,"2022":57,"2023":58},0.26,0.16,0.17,3,{"id":61,"createTime":62,"updateTime":63,"relativeEntities":64,"slug":65,"properties":66,"entityType":24,"verifyStatus":25,"verifyTime":78,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":79,"subjectFields":80,"manageAffiliations":81,"indexDatabases":136,"url":137,"thumbnailPath":26,"statistic":138,"gsStatistic":155,"type":175,"analyzePriority":26},"25b6bd10-676c-40c0-8dc3-356d1679a284","2023-05-19T02:22:33.430+00:00","2026-06-18T23:33:57.141+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Y-D%C6%B0%E1%BB%A3c-h%E1%BB%8Dc-C%E1%BA%A7n-Th%C6%A1",{"country":67,"issn":68,"introduce":70,"title":73,"gsId":76},{"VOID":15},{"VOID":69},"23541210",{"EN":71,"VI":72},"\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">04\u002F10\u002F2015 Ministry of Information and Communications allowed Can Tho journal of medicine and pharmacy to operate (102 \u002FGP-BTTTT)\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">07\u002F16\u002F2015 Can Tho journal of medicine and pharmacy is internationally recognized: ISSN 2354-1210\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">In 2016, The journal has been included in the list of medical science journals by The State Council for professorship which is awarded a work score of 0-0.5 points for a published article.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Can Tho Journal of Medicine and Pharmacy welcome original works that haven’t been submitted or published in other medical journals. Posts must contain content related to one of the journal’s categories.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The content published\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The journal is divided into 3 categories:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Scientific research article: are valuable scientific works, which have been researched and accepted.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Overview of medicine, biology and pharmacy: serving the objective of continuing training in the fields of medicine, biology and pharmacy; to systematize classical and modern knowledge.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Update information on new knowledge about medicine, biology, pharmacy in the country and in the world.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Scope\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Publication and introduction of scientific research in the fields:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Medicine (internal medicine, surgery, pediatrics, obstetrics and gynecology, odonto-stomatology, laboratory, oncology, traditional medicine, nursing).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Biology (genetics, biotechnology).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Pharmacology (pharmaceutics, drug quality analysis-control, synthetic pharmaceutical chemistry, biochemistry, pharmacognosy, botany, clinical pharmacy).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- To enhance the quality of undergraduate, postgraduate education, scientifically researching and meet the necessary treatment in hospital.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Introducing the updated domestic and oversea information about science technology to promote scientific research and exchanging technology in local, other universities.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Exchanging pharmaceutical and medical information for social health developing in the Mekong Delta and Vietnam.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The object\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Postgraduate students, student of Can Tho University of Medicine and Pharmacy, scientists from schools, research institutes, hospitals, health centers, pharmaceutical companies of the Mekong Delta; other provinces and regions in Vietnam and other country.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Address\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Headquarters of Can Tho Journal of Medicine and Pharmacy, located Scientific Research and International Cooperation Office: 179 Nguyen Van Cu Street, An Khanh Ward, Ninh Kieu District, Can Tho City, Vietnam.\u003C\u002Fspan>\u003C\u002Fp>","\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Ngày 16\u002F7\u002F2015, Tạp chí Y Dược học Cần Thơ được cấp chỉ số quốc tế: ISSN 2354-1210.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Từ tháng 4\u002F2016, Tạp chí đã được Hội đồng Giáo sư ngành Y đưa vào danh sách các tạp chí khoa học Y học được tính điểm công trình 0-0,5 điểm cho một bài báo đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Năm 2020 Tạp chí Y Dược học Cần Thơ đã được phê duyệt vào danh mục của các Hội đồng Giáo sư ngành Dược học được tính điểm công trình 0-0,5 điểm cho một bài báo đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ ra 12 số\u002Fnăm, 180-200 trang\u002Fsố.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Từ tháng 12\u002F2022 Tạp chí Y Dược học Cần Thơ là thành viên của hệ thống Crossref và từ tháng 01\u002F2023 tạp chí thực hiện bình duyệt online kín 2 chiều nhằm tăng tính minh bạch, tin cậy của các công trình nghiên cứu khoa học và đảm bảo tốt nhất chất lượng khoa học của bài viết.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tôn chỉ, mục đích và phạm vi của tạp chí\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tôn chỉ và mục đích hoạt động của tạp chí: xuất bản nhằm mục đích phổ biến kết quả từ các đề tài nghiên cứu khoa học; giao lưu trao đổi khoa học, chia sẻ kinh nghiệm, học tập, đồng thời cập nhật thông tin khoa học mới trong các lĩnh vực y, sinh, dược học trong và ngoài nước.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Phạm vi của tạp chí: Tạp chí xuất bản được chia thành 3 chuyên mục: (i) Bài báo nghiên cứu khoa học là kết quả công trình nghiên cứu khoa học có giá trị đã được triển khai nghiên cứu, (ii) Bài tổng quan y, sinh, dược học: phục vụ mục tiêu đào tạo liên tục trong lĩnh vực y, sinh, dược học; nhằm hệ thống hóa những kiến thức kinh điển và hiện đại; (iii) Thông tin cập nhật kiến thức mới về y, sinh, dược học trong nước và trên thế giới.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Chính sách truy cập mở\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ áp dụng chính sách truy cập mở đối với các bài báo đã xuất bản đến với độc giả, nhằm mở rộng cơ hội tiếp cận các kết quả nghiên cứu chất lượng cao và tăng cường trao đổi kiến thức. Tạp chí đăng tải trực tuyến (miễn phí) toàn văn các bài báo được công bố trên website của Tạp chí (https:\u002F\u002Ftapchi.ctump.edu.vn).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đạo đức xuất bản\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ cam kết tuân thủ đạo đức xuất bản phù hợp với các hướng dẫn và tiêu chuẩn của the Committee on Publication Ethics (COPE), tuân thủ các nguyên tắc của COPE’s Core Practices, Best Practices Guidelines for Journal Editors và Guidelines on Good Publication Practices.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Bản thảo bài báo chỉ được chấp nhận khi được tác giả chịu trách nhiệm chính cam kết các nội dung sau: Các nội dung của bản thảo chưa được đăng tải toàn bộ hoặc một phần ở các tạp chí khác; Tất cả các tác giả đều có đóng góp một cách đáng kể vào quá trình nghiên cứu hoặc chuẩn bị bản thảo và cùng chịu trách nhiệm về các nội dung của bản thảo; Tuân thủ các biện pháp đảm bảo đạo đức nghiên cứu (ví dụ thỏa thuận đồng ý tham gia nghiên cứu).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Cam kết bảo mật\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí cam kết thực hiện và tuân thủ các quy định của luật và các văn bản hướng dẫn liên quan đến bảo mật thông tin cá nhân trên không gian mạng. Các thông tin mà người dùng (tác giả, độc giả, biên tập viên, người phản biện) nhập vào các biểu mẫu trên Hệ thống Quản lý xuất bản trực tuyến của tạp chí chỉ được sử dụng vào các mục đích đã được tuyên bố rõ ràng và sẽ không được cung cấp cho bất kỳ bên thứ ba nào khác, hay dùng vào bất kỳ mục đích nào khác.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Phí gửi bài\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Lệ phí gửi đăng bài: 1.000.000đ\u002Fbài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Lệ phí gửi đăng nhanh: 1.500.000đ\u002Fbài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đối với tác giả là cán bộ viên chức thuộc Trường Đại học Y Dược Cần Thơ thì được hỗ trợ 50% lệ phí gửi đăng bài.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đối với sinh viên thực hiện đề tài nghiên cứu khoa học cấp trường được hỗ trợ 100% lệ phí đăng bài ( Tác giả gửi đính kèm “ Quyết định về việc giao tổ chức thực hiện đề tài nghiên cứu khoa học cấp Trường của sinh viên”).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Hình thức nộp lệ phí:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Tiền mặt:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Nộp trực tiếp tại Phòng Tài chính - Kế toán, Trường Đại học Y Dược Cần Thơ, số 179 Nguyễn Văn Cừ, P. An Khánh, Q. Ninh Kiều, thành phố Cần Thơ.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Chuyển khoản:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tên Tài khoản: Trường ĐHYD Cần Thơ, Số TK: 0111000115668, tại ngân hàng Vietcombank chi nhánh Cần Thơ.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Thời gian: Áp dụng từ ngày 01\u002F02\u002F2023.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">* Phí gửi bài không được hoàn trả khi bài viết bị từ chối hoặc tác giả xin rút bài viết.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Quy trình phản biện bài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ thực hiện quy trình phản biện kín hai chiều nghiêm ngặt. Danh tính của những người phản biện không được tiết lộ cho các tác giả và ngược lại. Quy trình thẩm định bài báo đăng gồm các bước sau:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tiếp nhận bản thảo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tác giả liên hệ gửi bản thảo đến Tạp chí qua hệ thống trực tuyến tại website: https:\u002F\u002Ftapchi.ctump.edu.vn. Hướng dẫn về cách đăng ký, gửi bài và chuẩn bị bản thảo được cung cấp trên website của Tạp chí.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Sàng lọc sơ bộ\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Sau khi Tòa soạn nhận được bài báo của tác giả, Ban Thư ký sẽ tiến hành kiểm tra sơ bộ bài báo (các yêu cầu về nội dung và hình thức). Những bài báo không đúng quy cách hoặc có nội dung không phù hợp hoặc vi phạm bản quyền sẽ bị từ chối (Ban Thư ký thông báo phản hồi đến tác giả trong vòng 1 tuần). Những bài báo đủ điều kiện, được Ban Thư ký tòa soạn chuyển đến Ban Biên tập có cùng chuyên môn với nội dung bài báo để đề xuất người phản biện. Thời gian kể từ khi Ban Biên tập nhận bài báo đến khi đề xuất người phản biện bài báo chậm nhất là 5 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Vòng phản biện\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Ban Thư ký gửi bài và yêu cầu phản biện đến 02 phản biện độc lập.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Các phản biện gởi nhận xét cho Ban Thư ký. Thời gian từ khi gửi bài cho phản biện đến khi nhận ý kiến của phản biện tối đa là 20 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Xử ký kết quả phản biện\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Nếu ý kiến đồng ý cho đăng và không cần chỉnh sửa, Ban Thư ký tiếp tục đăng bài theo qui trình.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Nếu ý kiến đồng ý đăng và cần chỉnh sửa, Ban Thư ký sẽ thông tin đến tác giả chỉnh sửa theo yêu cầu của người phản biện. Thời gian chỉnh sửa và gửi lại kéo dài không quá 2 tuần, từ khi tác giả bài báo nhận được thông tin (Quá trình này có thể lặp lại tối đa 2 lần\u002F1 bài báo). Khi có sự thống nhất, đồng ý của người phản biện; bài báo được tiếp tục đăng theo qui trình.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">3. Những bài báo có chất lượng không đạt yêu cầu, cả 2 phản biện không đồng ý cho đăng sẽ bị Tòa soạn từ chối đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Xuất bản\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Ban Thư ký tổng hợp các bản thảo đã được tác giả hoàn thiện sau thẩm định trình Ban Biên tập xem xét, Tổng Biên tập phê duyệt, quyết định bài đăng theo các tiêu chí: sự phù hợp nội dung với tôn chỉ và mục đích, thể loại bài viết (ưu tiên các bài có bài có nghiên cứu chuyên sâu, hàm lượng khoa học cao), đóng góp mới bài báo, bài báo được ưu tiên đăng trong số gần nhất của Tạp chí theo thứ tự: tính thời sự, chất lượng bài báo và thời gian gửi bài.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Ban Biên tập và Ban Thư ký biên tập bản thảo, chế bản, đọc rà soát lỗi. Thời gian hoàn thành từ 10-15 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">3. Ban Thư ký có trách nhiệm thông báo cho tác giả bài báo (bằng e-mail) về tình hình phê duyệt bài báo, thời gian, số kỳ, tập xuất bản bài báo theo qui định.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">4. Danh sách bài báo theo số Tạp chí được in ấn và phát hành trong năm định kỳ được công bố chính thức trên website: https:\u002F\u002Ftapchi.ctump.edu.vn\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>",{"EN":74,"VI":75},"Cantho Journal of Medicine and Pharmacy","Tạp chí Y Dược học Cần Thơ",{"VOID":77},"wcQ1uqwAAAAJ","2023-05-30T08:17:21.868+00:00",32,[],[82],{"id":83,"createTime":84,"updateTime":85,"relativeEntities":86,"slug":87,"properties":88,"entityType":98,"verifyStatus":25,"verifyTime":99,"verifyNote":26,"syncStatus":28,"languages":100,"translateLanguages":26,"viewCount":103,"url":104,"parentIds":105,"statistic":106},"6413896b-eca9-442b-a73f-182a58a0ce40","2023-06-12T14:59:13.446+00:00","2026-06-19T02:29:32.871+00:00",[],"Tr%C6%B0%E1%BB%9Dng-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Y-D%C6%B0%E1%BB%A3c-C%E1%BA%A7n-Th%C6%A1",{"country":89,"title":90,"address":93,"abbreviation":96},{"VOID":15},{"EN":91,"VI":92},"Can Tho University of Medicine and Pharmacy","Trường Đại học Y Dược Cần Thơ",{"VI":94,"EN":95},"Số 179, đường Nguyễn Văn Cừ, phường An Khánh, quận Ninh Kiều, thành phố Cần Thơ, Việt Nam","No 179, Nguyen Van Cu street, An Khanh ward, Ninh Kieu district, Can Tho city, Vietnam",{"VOID":97},"ctump","AFFILIATION","2023-08-01T14:07:27.977+00:00",[101,102],"VI","EN",12,"http:\u002F\u002Fwww.ctump.edu.vn\u002F",[],{"impactFactor":36,"impactFactorByYear":107,"i10Index":111,"i10IndexLast5Year":59,"totalPublication":112,"totalPublicationByYear":113,"totalCitation":122,"totalCitationByYear":123,"totalCitationPerPublication":128,"totalCitationPerPublicationByYear":129,"hindexLast5Year":135,"hindex":135},{"2022":108,"2023":109,"2024":110,"2025":38},0.1,0.05,0.07,4,1489,{"2013":114,"2014":115,"2015":115,"2016":111,"2017":115,"2018":59,"2019":114,"2020":116,"2021":117,"2022":118,"2023":119,"2024":120,"2025":121,"2026":111},2,1,10,84,281,680,260,156,313,{"2013":59,"2014":114,"2018":124,"2021":125,"2022":126,"2023":127},17,36,123,132,0.21,{"2013":130,"2014":114,"2018":131,"2021":132,"2022":133,"2023":134},1.5,5.67,0.43,0.44,0.19,6,[],"https:\u002F\u002Ftapchi.ctump.edu.vn\u002Findex.php\u002Fctump",{"impactFactor":36,"impactFactorByYear":139,"i10Index":114,"i10IndexLast5Year":114,"totalPublication":140,"totalPublicationByYear":141,"totalCitation":147,"totalCitationByYear":148,"totalCitationPerPublication":151,"totalCitationPerPublicationByYear":152,"hindexLast5Year":135,"hindex":135},{"2022":38,"2023":36,"2024":39,"2025":38},1956,{"0":114,"2019":114,"2020":50,"2021":142,"2022":143,"2023":144,"2024":145,"2025":146},76,403,789,305,371,524,{"0":114,"2019":135,"2021":124,"2022":149,"2023":150,"2024":111,"2025":114},287,206,0.27,{"0":115,"2019":59,"2021":153,"2022":154,"2023":56,"2024":38,"2025":38},0.22,0.71,{"impactFactor":26,"impactFactorByYear":26,"i10Index":114,"i10IndexLast5Year":114,"totalPublication":156,"totalPublicationByYear":157,"totalCitation":163,"totalCitationByYear":164,"totalCitationPerPublication":169,"totalCitationPerPublicationByYear":170,"hindexLast5Year":135,"hindex":135},461,{"0":158,"2019":114,"2021":159,"2022":160,"2023":161,"2024":158,"2025":162},7,37,296,107,5,419,{"2021":59,"2022":59,"2023":165,"2024":166,"2025":167,"2026":168},71,126,171,41,0.91,{"2021":171,"2022":38,"2023":172,"2024":173,"2025":174},0.08,0.66,18,34.2,"JOURNAL",{"id":177,"createTime":178,"updateTime":179,"relativeEntities":180,"slug":181,"properties":182,"entityType":24,"verifyStatus":25,"verifyTime":193,"verifyNote":26,"syncStatus":28,"languages":194,"translateLanguages":26,"viewCount":36,"subjectFields":195,"manageAffiliations":196,"indexDatabases":197,"url":198,"thumbnailPath":26,"statistic":26,"gsStatistic":199,"type":175,"analyzePriority":26},"f8d0bf97-8d89-482e-b58c-2fc481a0b79b","2025-10-27T06:27:08.591+00:00","2026-06-18T23:33:41.667+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Khoa-h%E1%BB%8Dc-v%C3%A0-C%C3%B4ng-ngh%E1%BB%87-nhi%E1%BB%87t-%C4%91%E1%BB%9Bi",{"country":183,"introduce":184,"gsId":186,"title":188,"issn":191},{"VOID":15},{"EN":185},"\u003Cp style=\"text-align:justify;\">     Journal of Tropical Science and Engineering (JTSE) is a multidisciplinary scientific journal, licensed to operate as a print journal in 2012 and an electronic journal in 2024 (License No.1479\u002FGP-BTTTT dated August 20, 2012 and No.91\u002FGP-BTTTT dated April 9, 2024 issued by the Ministry of Information and Communications of Vietnam). The JTSE is headquartered in Hanoi.\u003C\u002Fp>\u003Cp style=\"text-align:justify;\">        The JTSE is published every 3 months (4 issues\u002Fyear), publishing research results and overview articles in 3 groups of fields: Tropical Ecology and Environment; Chemistry and Material Sciences; Biomedicine and Pharmacy. In 2022, the JTSE registered the international identifier Digital Object Identifier (DOI): 10.58334\u002Fvrtc.jtst and assigned DOI codes to all articles of the journal. The members of the Editorial Board of the JTSE are prestigious scientists and leading scientists from Vietnam and many countries in the world. The JTSE has been recognized by the Vietnam State Council for Professorship to score scientific articles in Chemistry, Medicine and Biology with scores ranging from 0-0.75 points.\u003C\u002Fp>\u003Cp style=\"text-align:justify;\">      Currently, the JTSE is building and perfecting a set of criteria and making efforts to join the List of prestigious  international journals with a roadmap to enter Scopus and SCIE in the coming time.\u003C\u002Fp>",{"VOID":187},"MS2_GJQAAAAJ",{"VI":189,"EN":190},"Tạp chí Khoa học và Công nghệ nhiệt đới","Journal of Tropical Science and Engineering",{"VOID":192},"08667535","2025-10-27T06:27:25.058+00:00",[101,102],[],[],[],"https:\u002F\u002Ftapchikhcnnd.com.vn",{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":200,"totalPublicationByYear":201,"totalCitation":161,"totalCitationByYear":203,"totalCitationPerPublication":153,"totalCitationPerPublicationByYear":205,"hindexLast5Year":114,"hindex":114},481,{"0":115,"2020":115,"2021":115,"2022":114,"2024":115,"2025":202,"2026":115},474,{"2017":114,"2018":115,"2019":111,"2020":162,"2021":162,"2022":116,"2023":50,"2024":162,"2025":204,"2026":52},52,{"2020":162,"2021":162,"2022":162,"2024":162,"2025":206,"2026":52},0.11,{"id":208,"createTime":209,"updateTime":210,"relativeEntities":211,"slug":212,"properties":213,"entityType":24,"verifyStatus":25,"verifyTime":221,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":222,"subjectFields":223,"manageAffiliations":224,"indexDatabases":225,"url":226,"thumbnailPath":26,"statistic":227,"gsStatistic":276,"type":175,"analyzePriority":26},"a3d1e82a-57e2-40f9-940e-f5fa8b9ef64a","2023-06-01T07:11:26.039+00:00","2026-06-18T23:33:28.573+00:00",[],"VNU-Journal-of-Science-Earth-and-Environmental-Sciences",{"issn":214,"title":216,"country":218,"gsId":219},{"VOID":215},"26159279",{"EN":217},"VNU Journal of Science: Earth and Environmental Sciences",{"VOID":15},{"VOID":220},"UmXD8vEAAAAJ","2023-06-01T07:17:59.210+00:00",27,[],[],[],"https:\u002F\u002Fjs.vnu.edu.vn\u002FEES",{"impactFactor":36,"impactFactorByYear":228,"i10Index":234,"i10IndexLast5Year":36,"totalPublication":235,"totalPublicationByYear":236,"totalCitation":246,"totalCitationByYear":247,"totalCitationPerPublication":261,"totalCitationPerPublicationByYear":262,"hindexLast5Year":103,"hindex":103},{"2010":229,"2012":40,"2013":230,"2014":230,"2015":231,"2016":54,"2017":171,"2018":109,"2019":110,"2020":57,"2021":232,"2022":233,"2023":151,"2024":58},0.02,0.04,0.09,0.31,0.4,19,656,{"2008":237,"2009":238,"2010":239,"2011":238,"2012":240,"2013":241,"2014":239,"2015":242,"2016":243,"2017":244,"2018":245,"2019":165,"2020":125,"2021":168,"2022":125,"2023":222,"2024":111},23,24,22,28,25,20,146,29,78,1038,{"2008":248,"2009":249,"2010":250,"2011":251,"2012":252,"2013":253,"2014":254,"2015":255,"2016":256,"2017":257,"2018":161,"2019":258,"2020":259,"2021":29,"2022":260},119,64,66,86,38,73,59,31,129,39,97,53,26,1.58,{"2008":263,"2009":264,"2010":59,"2011":265,"2012":266,"2013":267,"2014":268,"2015":269,"2016":270,"2017":271,"2018":272,"2019":272,"2020":273,"2021":274,"2022":275},5.17,2.67,3.58,1.36,2.92,2.68,1.55,0.88,1.34,1.37,1.47,1.24,0.72,{"impactFactor":26,"impactFactorByYear":26,"i10Index":173,"i10IndexLast5Year":135,"totalPublication":277,"totalPublicationByYear":278,"totalCitation":279,"totalCitationByYear":280,"totalCitationPerPublication":288,"totalCitationPerPublicationByYear":289,"hindexLast5Year":158,"hindex":298},113,{"2007":114,"2008":103,"2009":173,"2010":116,"2011":51,"2012":239,"2013":103,"2014":162,"2015":53,"2016":135},616,{"2009":162,"2010":114,"2011":52,"2012":124,"2013":222,"2014":255,"2015":48,"2016":44,"2017":281,"2018":282,"2019":259,"2020":283,"2021":284,"2022":285,"2023":286,"2024":257,"2025":287,"2026":59},54,60,49,47,34,44,33,5.45,{"2009":290,"2010":291,"2011":292,"2012":293,"2013":294,"2014":295,"2015":296,"2016":297},0.28,0.2,0.6,0.77,2.25,6.2,3.91,9.67,14,{"id":300,"createTime":301,"updateTime":302,"relativeEntities":303,"slug":304,"properties":305,"entityType":24,"verifyStatus":25,"verifyTime":316,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":234,"subjectFields":317,"manageAffiliations":318,"indexDatabases":388,"url":389,"thumbnailPath":390,"statistic":391,"gsStatistic":409,"type":175,"analyzePriority":26},"a7166325-6c9e-4db3-8a59-7c879701a372","2023-07-31T04:28:49.231+00:00","2026-06-18T23:33:22.428+00:00",[],"VNU-Journal-of-Science-Policy-and-Management-Studies",{"country":306,"issn":307,"eissn":309,"title":311,"gsId":314},{"VOID":15},{"VOID":308},"26159295",{"VOID":310},"25881116",{"EN":312,"VI":313},"VNU Journal of Science: Policy and Management Studies","Tạp chí Nghiên cứu Chính sách và Quản lý",{"VOID":315},"xKW2E_cAAAAJ","2023-08-01T03:23:46.688+00:00",[],[319],{"id":320,"createTime":321,"updateTime":322,"relativeEntities":323,"slug":324,"properties":325,"entityType":98,"verifyStatus":25,"verifyTime":335,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":336,"url":337,"parentIds":338,"statistic":339},"12466116-8f60-4b01-8faf-2411483a0977","2023-05-30T09:37:38.472+00:00","2026-06-19T02:14:28.352+00:00",[],"Vietnam-National-University",{"country":326,"title":327,"abbreviation":330,"address":332},{"VOID":15},{"EN":328,"VI":329},"Vietnam National University, Hanoi","Đại học Quốc gia Hà Nội",{"VOID":331},"VNU",{"VI":333,"EN":334},"Số 144 Xuân Thủy, Phường Dịch Vọng Hậu, Quận Cầu Giấy, Hà Nội, Việt Nam","No. 144 Xuan Thuy Street, Dich Vong Hau Ward, Cau Giay District, Hanoi, Vietnam","2023-08-02T13:58:17.029+00:00",16,"http:\u002F\u002Fwww.vnu.edu.vn\u002F",[],{"impactFactor":36,"impactFactorByYear":340,"i10Index":285,"i10IndexLast5Year":162,"totalPublication":344,"totalPublicationByYear":345,"totalCitation":354,"totalCitationByYear":355,"totalCitationPerPublication":368,"totalCitationPerPublicationByYear":369,"hindexLast5Year":336,"hindex":336},{"2014":109,"2015":231,"2016":231,"2017":206,"2018":341,"2019":110,"2020":342,"2021":343,"2022":171,"2023":231,"2024":110,"2025":39},0.06,0.18,0.35,1247,{"2003":115,"2004":115,"2005":114,"2006":59,"2007":111,"2008":162,"2009":59,"2010":50,"2011":124,"2012":336,"2013":260,"2014":244,"2015":250,"2016":281,"2017":346,"2018":347,"2019":348,"2020":349,"2021":350,"2022":351,"2023":352,"2024":353,"2025":255,"2026":50},94,88,83,67,176,185,187,93,1644,{"2004":111,"2005":115,"2006":52,"2007":298,"2008":356,"2009":298,"2010":286,"2011":357,"2012":244,"2013":358,"2014":359,"2015":360,"2016":361,"2017":362,"2018":363,"2019":364,"2020":365,"2021":366,"2022":367,"2023":367,"2024":162},13,81,48,70,151,115,109,259,174,181,121,101,1.32,{"2004":111,"2005":370,"2006":59,"2007":371,"2008":372,"2009":373,"2010":374,"2011":375,"2012":376,"2013":377,"2014":378,"2015":379,"2016":380,"2017":381,"2018":382,"2019":383,"2020":384,"2021":385,"2022":386,"2023":387,"2024":109},0.5,3.5,2.6,4.67,5.5,4.76,1.81,1.85,2.41,2.29,2.13,1.16,2.94,2.1,2.7,0.69,0.55,0.54,[],"https:\u002F\u002Fjs.vnu.edu.vn\u002FPaM","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002Fa7166325-6c9e-4db3-8a59-7c879701a372\u002Fecfe83f4bcc60c7023ae04d8900fe0ac.jpg",{"impactFactor":36,"impactFactorByYear":392,"i10Index":111,"i10IndexLast5Year":36,"totalPublication":394,"totalPublicationByYear":395,"totalCitation":399,"totalCitationByYear":400,"totalCitationPerPublication":293,"totalCitationPerPublicationByYear":403,"hindexLast5Year":158,"hindex":158},{"2018":109,"2019":171,"2020":393,"2021":108,"2022":54,"2023":206,"2024":54},0.23,320,{"2015":50,"2016":239,"2017":286,"2018":396,"2019":397,"2020":159,"2021":398,"2022":168,"2023":79,"2024":255},30,35,40,247,{"2015":115,"2016":242,"2017":401,"2018":222,"2019":402,"2020":79,"2021":239,"2022":50,"2023":116},77,50,{"2015":404,"2016":169,"2017":405,"2018":406,"2019":407,"2020":408,"2021":386,"2022":291,"2023":232},0.12,1.75,0.9,1.43,0.86,{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":103,"totalPublicationByYear":410,"totalCitation":234,"totalCitationByYear":411,"totalCitationPerPublication":261,"totalCitationPerPublicationByYear":412,"hindexLast5Year":114,"hindex":59},{"2015":114,"2016":116},{"2016":115,"2017":114,"2018":114,"2019":59,"2020":114,"2021":59,"2022":114,"2023":114,"2024":115,"2026":115},{"2016":108},{"id":414,"createTime":415,"updateTime":416,"relativeEntities":417,"slug":418,"properties":419,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":238,"subjectFields":428,"manageAffiliations":429,"indexDatabases":430,"url":431,"thumbnailPath":26,"statistic":432,"gsStatistic":438,"type":175,"analyzePriority":26},"16e65a3f-d274-47dd-8691-56d76eb58c3d","2023-05-30T09:10:06.062+00:00","2026-06-18T23:33:17.679+00:00",[],"Vietnam-Journal-of-Otorhinolaryngology-Head-and-Neck-Surgery",{"country":420,"issn":421,"title":423,"gsId":426},{"VOID":15},{"VOID":422},"18593704",{"EN":424,"VI":425},"Vietnam Journal of Otorhinolaryngology - Head and Neck Surgery","Tạp chí Tai Mũi Họng Việt Nam",{"VOID":427},"L78B_eIAAAAJ",[],[],[],"https:\u002F\u002Ftapchitaimuihong.vn\u002Findex.php\u002Ftmh",{"impactFactor":36,"impactFactorByYear":433,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":434,"totalPublicationByYear":435,"totalCitation":111,"totalCitationByYear":436,"totalCitationPerPublication":230,"totalCitationPerPublicationByYear":437,"hindexLast5Year":115,"hindex":115},{"2024":229},95,{"2022":52,"2023":286,"2024":255,"2025":53},{"2023":111},{"2023":231},{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":240,"totalPublicationByYear":439,"totalCitation":234,"totalCitationByYear":440,"totalCitationPerPublication":441,"totalCitationPerPublicationByYear":442,"hindexLast5Year":114,"hindex":114},{"2023":53,"2024":116,"2025":135,"2026":115},{"2024":59,"2025":298,"2026":114},0.68,{"2024":443,"2025":444,"2026":114},0.3,2.33,{"id":446,"createTime":447,"updateTime":448,"relativeEntities":449,"slug":450,"properties":451,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":396,"subjectFields":460,"manageAffiliations":461,"indexDatabases":462,"url":463,"thumbnailPath":464,"statistic":465,"gsStatistic":472,"type":175,"analyzePriority":26},"25988add-c322-4eda-afda-63b1559bb824","2023-04-07T03:49:55.817+00:00","2026-06-18T23:32:23.776+00:00",[],"T%E1%BA%A1p%20ch%C3%AD%20Y%20-%20D%C6%B0%E1%BB%A3c%20h%E1%BB%8Dc%20qu%C3%A2n%20s%E1%BB%B1",{"country":452,"issn":453,"title":455,"gsId":458},{"VOID":15},{"VOID":454},"18590748",{"EN":456,"VI":457},"Journal of Military Pharmaco-medicine","Tạp chí Y - Dược học quân sự",{"VOID":459},"_pmQ8IEAAAAJ",[],[],[],"https:\u002F\u002Fjmpm.vn\u002Findex.php\u002Fjmpm","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F25988add-c322-4eda-afda-63b1559bb824\u002F09c6bc42157cf5ece95edc971ccddb52.jpg",{"impactFactor":36,"impactFactorByYear":466,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":467,"totalPublicationByYear":468,"totalCitation":135,"totalCitationByYear":470,"totalCitationPerPublication":38,"totalCitationPerPublicationByYear":471,"hindexLast5Year":115,"hindex":115},{"2023":229,"2024":38},475,{"2022":168,"2023":365,"2024":469,"2025":124},236,{"2022":114,"2023":111},{"2022":109,"2023":229},{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":277,"totalPublicationByYear":473,"totalCitation":401,"totalCitationByYear":474,"totalCitationPerPublication":441,"totalCitationPerPublicationByYear":475,"hindexLast5Year":59,"hindex":59},{"2015":115,"2018":114,"2019":115,"2020":115,"2021":59,"2022":103,"2023":159,"2024":287,"2025":237},{"2020":115,"2021":115,"2022":115,"2023":52,"2024":237,"2025":79,"2026":116},{"2020":115,"2021":476,"2022":171,"2023":477,"2024":478,"2025":479},0.33,0.24,0.7,1.39,{"id":481,"createTime":482,"updateTime":483,"relativeEntities":484,"slug":485,"properties":486,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":27,"syncStatus":28,"languages":496,"translateLanguages":26,"viewCount":45,"subjectFields":497,"manageAffiliations":498,"indexDatabases":525,"url":526,"thumbnailPath":527,"statistic":528,"gsStatistic":26,"type":26,"analyzePriority":26},"2b8d7b12-2d20-4777-be98-077f44f03c69","2023-09-07T07:40:58.286+00:00","2025-07-13T21:21:00.542+00:00",[],"VNU-Journal-of-Social-Sciences-and-Humanities",{"country":487,"issn":488,"introduce":490,"title":493},{"VOID":15},{"VOID":489},"23541172",{"EN":491,"VI":492},"{\"ops\":[{\"insert\":\"VNU Journal of Social Sciences and Humanities (ISSN 2354-1172) is a double-blind peer-reviewed journal published by University of Social Sciences and Humanities, Vietnam National University, Hanoi, Vietnam, under the publication permit no. 155\u002FGP-BTTTT, issued on 11\"},{\"attributes\":{\"script\":\"super\"},\"insert\":\"th \"},{\"insert\":\"May, 2015 by Ministry of Information and Communications. The journal publishes four Vietnamese issues and two English issues per year.\\nCurrently, there are 35 reputable professors in the editorial board. The main objectives of the journal include: providing an intellectual platform for Vietnamese and international scholars; promoting interdisciplinary studies in social sciences and humanities; becoming the leading journal in social sciences and humanities in Vietnam; being indexed by worldwide databases and having academic recognition internationally in the near future.\\nThe journal is currently indexed by Google Scholar, WorldCat, Open Archives, Cosmos Impact Factor, Advanced Sciences Index, Scientific Indexing Services, CrossRef, EBSCO Information Services and Vietnam National University’s digital archive.\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Journal of Social Sciences and Humanities-Vietnam\"},{\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"ISSN 2354-1172, email: tapchikhxhnv@gmail.com, tckhxhnv@vnu.edu.vn\"},{\"insert\":\"\\n\"}]}","{\"ops\":[{\"insert\":\"Được thành lập ngày 31\u002F8\u002F2015 (giấy phép hoạt động số 155\u002FGP-BVHTT ngày 11 tháng 5 năm 2015 của Bộ Thông tin và Truyền thông, mã số tiêu chuẩn quốc tế ISSN 2354-1172), Tạp chí Khoa học Xã hội và Nhân văn (Journal of Social Sciences and Humanities) là ấn phẩm khoa học chính thức, duy nhất của Trường Đại học Khoa học Xã hội và Nhân văn, ĐHQG Hà Nội, phát triển và kế thừa Chuyên san Khoa học Xã hội và Nhân văn, Tạp chí Khoa học, ĐHQG Hà Nội.\\nTạp chí xuất bản định kỳ (04 số tiếng Việt\u002Fnăm và 02 số tiếng Anh\u002Fnăm), có nhiệm vụ \"},{\"attributes\":{\"italic\":true},\"insert\":\"công bố, giới thiệu các công trình nghiên cứu khoa học khoa học xã hội và nhân văn của các tác giả là các nhà khoa học trong và ngoài nước, phục vụ giảng dạy, học tập và nghiên cứu khoa học\"},{\"insert\":\". Hội đồng biên tập của Tạp chí hiện bao gồm 33 nhà khoa học có uy tín trong nước và quốc tế. Tạp chí tập trung và ưu tiên đăng tải những bài báo theo định hướng của tinh thần cởi mở, sáng tạo, nhanh chóng vươn lên để tiếp cận và sánh ngang với các tạp chí có uy tín hàng đầu của khu vực và trên thế giới. Nội dung chính của Tạp chí bao gồm các Bài nghiên cứu (khoảng 6000 đến 15000 từ), các bài điểm sách, thông tin khoa học (khoảng 300 đến 1500 từ) được trình bày theo đúng cấu trúc và chuẩn mực của một tạp chí khoa học.\\nCác bài viết của Tạp chí hiện đang được trích dẫn bởi Google Scholar, WorldCat, Open Archives, Cosmos Impact Factor, Advanced Sciences Index, Scientific Indexing Services, CrossRef, EBSCO Information Services.\\nMọi thông tin xin liên hệ: \"},{\"attributes\":{\"italic\":true},\"insert\":\"Phòng Tạp chí, 701 - E, Trường Đại học Khoa học Xã hội và Nhân văn, 336 Nguyễn Trãi, Thanh Xuân, Hà Nội. ĐT: 024.35581984; email: tckhxhnv@vnu.edu.vn \"},{\"insert\":\"hoặc \"},{\"attributes\":{\"italic\":true},\"insert\":\"tapchikhxhnv@gmail.com \"},{\"insert\":\"\\n\"}]}",{"EN":494,"VI":495},"VNU Journal of Social Sciences and Humanities","Tạp chí Khoa học Xã hội và Nhân văn",[101,102],[],[499],{"id":500,"createTime":501,"updateTime":502,"relativeEntities":503,"slug":504,"properties":505,"entityType":98,"verifyStatus":25,"verifyTime":509,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":222,"url":26,"parentIds":510,"statistic":511},"8b6e349b-0daf-4895-9c3f-85f30f1bfd42","2023-07-31T12:55:58.430+00:00","2026-06-19T02:30:07.899+00:00",[],"Tr%C6%B0%E1%BB%9Dng-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Khoa-h%E1%BB%8Dc-X%C3%A3-h%E1%BB%99i-v%C3%A0-Nh%C3%A2n-v%C4%83n-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Qu%E1%BB%91c-gia-H%C3%A0-N%E1%BB%99i",{"title":506},{"EN":507,"VI":508},"VNU University of Social Sciences and Humanities","Trường Đại học Khoa học Xã hội và Nhân văn, Đại học Quốc gia Hà Nội","2023-08-02T15:28:49.057+00:00",[],{"impactFactor":36,"impactFactorByYear":512,"i10Index":59,"i10IndexLast5Year":115,"totalPublication":514,"totalPublicationByYear":515,"totalCitation":518,"totalCitationByYear":519,"totalCitationPerPublication":520,"totalCitationPerPublicationByYear":521,"hindexLast5Year":162,"hindex":162},{"2016":229,"2017":230,"2018":229,"2021":230,"2022":58,"2023":513,"2024":38},0.15,365,{"2013":115,"2014":158,"2015":125,"2016":252,"2017":44,"2018":516,"2019":286,"2020":396,"2021":259,"2022":517,"2023":396,"2024":115,"2025":59,"2026":115},21,42,169,{"2015":283,"2016":135,"2017":52,"2018":50,"2019":298,"2020":53,"2021":359,"2022":115,"2023":115},0.46,{"2015":266,"2016":57,"2017":57,"2018":522,"2019":523,"2020":524,"2021":368,"2022":229,"2023":39},0.38,0.32,0.37,[],"http:\u002F\u002Fjournal.ussh.vnu.edu.vn\u002Findex.php\u002Fvjossh","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F2b8d7b12-2d20-4777-be98-077f44f03c69\u002F0bd0751202944a4b4165b482e6e623e4.png",{"impactFactor":36,"impactFactorByYear":529,"i10Index":162,"i10IndexLast5Year":115,"totalPublication":530,"totalPublicationByYear":531,"totalCitation":537,"totalCitationByYear":538,"totalCitationPerPublication":343,"totalCitationPerPublicationByYear":540,"hindexLast5Year":135,"hindex":135},{"2016":341,"2017":39,"2018":229,"2019":38,"2020":110,"2021":231,"2022":231,"2023":341,"2024":39},764,{"2015":255,"2016":245,"2017":532,"2018":259,"2019":533,"2020":534,"2021":535,"2022":536,"2023":534,"2024":254,"2025":50},111,106,68,92,89,265,{"2015":539,"2016":241,"2017":168,"2018":51,"2019":349,"2020":260,"2021":244,"2022":298,"2023":114},46,{"2015":541,"2016":523,"2017":524,"2018":290,"2019":542,"2020":522,"2021":523,"2022":57,"2023":39},1.48,0.63,{"id":544,"createTime":545,"updateTime":546,"relativeEntities":547,"slug":548,"properties":549,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":558,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":50,"subjectFields":559,"manageAffiliations":560,"indexDatabases":561,"url":562,"thumbnailPath":563,"statistic":564,"gsStatistic":26,"type":26,"analyzePriority":26},"6ec01bd0-15c0-469a-86ac-41339076ae0a","2023-08-10T07:08:33.153+00:00","2026-01-31T21:19:06.362+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Da-li%E1%BB%85u-h%E1%BB%8Dc-Vi%E1%BB%87t-Nam",{"country":550,"issn":551,"introduce":553,"title":555},{"VOID":15},{"VOID":552},"18594824",{"VI":554},"{\"ops\":[{\"insert\":\"Tạp chí “Da liễu học Việt Nam” (Tiếng Anh: Vietnamese Journal of Dermatology and Venereology) thuộc Hội Da liễu Việt Nam, xuất bản 4 số mỗi năm bằng tiếng Việt hoặc tiếng Anh.\\nTạp chí Da liễu học Việt Nam hoạt động với mục đích, tôn chỉ là phổ biến, trao đổi thông tin trong lĩnh vực chuyên ngành da liễu; đăng tải các công trình nghiên cứu khoa học; chuyển giao công nghệ - kinh tế và khoa học kỹ thuật liên quan đến lĩnh vực da liễu.\\nPhạm vi của tạp chí là tất cả các bài báo khoa học, bài tổng quan, giới thiệu ca lâm sàng, … có liên quan tới chuyên ngành da liễu trong và ngoài nước. Tạp chí công bố các công trình nghiên cứu liên quan đến mô hình bệnh tật, các phương pháp chẩn đoán, điều trị, dự phòng và phục hồi chức năng các bệnh thuộc chuyên ngành da liễu. Ngoài ra, tạp chí còn đăng tải các bài tổng quan, cập nhật thông tin, kiến thức, hướng dẫn chẩn đoán, điều trị trong chuyên ngành da liễu trong nước và quốc tế; đăng tải các bài ca lâm sàng đặc biệt trong chuyên ngành da liễu.\\nTạp chí Da liễu học Việt Nam được biết tới là một tạp chí chuyên ngành có uy tín trong lĩnh vực da liễu. Các bài báo về nghiên cứu khoa học đăng trong Tạp chí được bình duyệt một cách nghiêm ngặt bởi ít nhất 2 chuyên gia. Hội đồng biên tập tạp chí bao gồm các nhà khoa học có uy tín (Giáo sư, Phó Giáo sư, Tiến sĩ, Bác sĩ…) trong chuyên ngành da liễu nhằm đảm bảo chất lượng và tính khách quan, khoa học cho các bài viết đăng trên Tạp chí.\\n\"}]}",{"EN":556,"VI":557},"Vietnamese Journal of Dermatology and Venereology","Tạp chí Da liễu học Việt Nam","Admin Import",[],[],[],"https:\u002F\u002Fvjdv.vn\u002Findex.php\u002Fvjdv","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F6ec01bd0-15c0-469a-86ac-41339076ae0a\u002F3cbc81720e58429dc7b1c4d7ab1935ca.jpg",{"impactFactor":36,"impactFactorByYear":565,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":566,"totalPublicationByYear":567,"totalCitation":116,"totalCitationByYear":570,"totalCitationPerPublication":109,"totalCitationPerPublicationByYear":571,"hindexLast5Year":115,"hindex":115},{"2023":38,"2024":230},182,{"2022":568,"2023":45,"2024":569},69,56,{"2022":52,"2023":115},{"2022":40,"2023":229},{"id":573,"createTime":574,"updateTime":575,"relativeEntities":576,"slug":577,"properties":578,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":27,"syncStatus":28,"languages":587,"translateLanguages":26,"viewCount":283,"subjectFields":588,"manageAffiliations":589,"indexDatabases":647,"url":648,"thumbnailPath":649,"statistic":650,"gsStatistic":26,"type":26,"analyzePriority":26},"19221551-7519-47ff-a892-331d1139c64b","2023-09-12T07:03:05.744+00:00","2026-01-24T20:54:40.144+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Khoa-h%E1%BB%8Dc-S%E1%BB%A9c-kho%E1%BA%BB-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Qu%E1%BB%91c-gia-Th%C3%A0nh-ph%E1%BB%91-H%E1%BB%93-Ch%C3%AD-Minh",{"country":579,"issn":580,"introduce":582,"title":584},{"VOID":15},{"VOID":581},"27349446",{"EN":583},"{\"ops\":[{\"attributes\":{\"bold\":true},\"insert\":\"1. History\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Science and Technology Development Journal\"},{\"insert\":\" (STDJ) (ISSN 2734-9446), Vietnam National University - Ho Chi Minh City (VNU-HCM) was established in 1997. And the first issue was published in January 1998 with ISSN 1859-0128. Since then, STDJ has become the most important scientific forum of scientists from VNU-HCM as well as other universities. The magazine has undergone 20 years of development and has become a bridge for scientific exchanges, as well as enriching reference materials for the faculty, doctoral students, students of VNU-HCM in particular and other universities, institutes...\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Science and Technology Development Journal - Health Sciences (STDJ-HS) is a subjournal of Science and Technology Development Journal since 2020.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\" \"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"2. Focus and Scope\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Publishing articles with contents on healthcare, research projects in the field of health, advanced directions in health education and management. Therefore, STDJ-HS will accept articles from doctors, administrators, teachers, researchers, graduate students and fellows. The authors will be responsible for the accuracy of the data, opinions, opinions and material cited in the article.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Facilitating the exchange of scientific and technological information and act as a bridge between theory and practice in the community of educators, scientists, managers, policy makers and enterprises in and out of the country.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}",{"EN":585,"VI":586},"VNUHCM JOURNAL OF HEALTH SCIENCES","Tạp chí Khoa học Sức khoẻ Đại học Quốc gia Thành phố Hồ Chí Minh",[101,102],[],[590],{"id":591,"createTime":592,"updateTime":593,"relativeEntities":594,"slug":595,"properties":596,"entityType":98,"verifyStatus":25,"verifyTime":606,"verifyNote":26,"syncStatus":28,"languages":607,"translateLanguages":26,"viewCount":608,"url":609,"parentIds":610,"statistic":611},"fc4c2560-868c-4677-acb1-8686bef88727","2023-06-26T04:48:23.774+00:00","2026-06-19T01:46:17.248+00:00",[],"%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Qu%E1%BB%91c-gia-Th%C3%A0nh-ph%E1%BB%91-H%E1%BB%93-Ch%C3%AD-Minh",{"country":597,"title":598,"abbreviation":601,"address":603},{"VOID":15},{"EN":599,"VI":600},"Vietnam National University Ho Chi Minh City","Đại học Quốc gia Thành phố Hồ Chí Minh",{"VOID":602},"VNUHCM",{"VI":604,"EN":605},"khu phố 6, Phường Linh Trung, Thành phố Thủ Đức, Thành phố Hồ Chí Minh, Việt Nam","Quarter 6, Linh Trung Ward, Thu Duc City, Ho Chi Minh City, Vietnam","2023-08-16T14:13:07.134+00:00",[101,102],45,"https:\u002F\u002Fvnuhcm.edu.vn\u002F",[],{"impactFactor":36,"impactFactorByYear":612,"i10Index":285,"i10IndexLast5Year":51,"totalPublication":613,"totalPublicationByYear":614,"totalCitation":624,"totalCitationByYear":625,"totalCitationPerPublication":634,"totalCitationPerPublicationByYear":635,"hindexLast5Year":124,"hindex":124},{"2014":36,"2015":38,"2016":109,"2017":39,"2018":229,"2019":38,"2020":110,"2021":171,"2022":110,"2023":110,"2024":171,"2025":229},3708,{"2005":115,"2006":115,"2007":115,"2008":135,"2009":111,"2010":53,"2011":52,"2012":568,"2013":615,"2014":351,"2015":616,"2016":469,"2017":617,"2018":127,"2019":618,"2020":619,"2021":620,"2022":621,"2023":622,"2024":623,"2025":159,"2026":50},164,266,177,226,603,931,314,246,74,2399,{"2006":115,"2008":50,"2010":162,"2011":242,"2012":222,"2013":43,"2014":626,"2015":627,"2016":628,"2017":629,"2018":258,"2019":630,"2020":631,"2021":632,"2022":633,"2023":353,"2024":115},250,124,157,162,152,385,559,128,0.65,{"2006":115,"2008":636,"2010":637,"2011":638,"2012":639,"2013":522,"2014":640,"2015":641,"2016":642,"2017":643,"2018":644,"2019":642,"2020":645,"2021":292,"2022":646,"2023":522,"2024":38},1.33,0.45,2.22,0.39,1.35,0.47,0.67,0.92,0.73,0.64,0.41,[],"http:\u002F\u002Fstdjhs.scienceandtechnology.com.vn\u002Findex.php\u002Fstdjhs","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F19221551-7519-47ff-a892-331d1139c64b\u002F2e10768b7d1e380c36a25ed0c714dd7e.png",{"impactFactor":36,"impactFactorByYear":651,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":652,"totalPublicationByYear":653,"totalCitation":516,"totalCitationByYear":654,"totalCitationPerPublication":151,"totalCitationPerPublicationByYear":655,"hindexLast5Year":59,"hindex":59},{"2022":57,"2023":108,"2024":39},79,{"2020":116,"2021":240,"2022":239,"2023":52,"2024":162,"2025":162},{"2020":59,"2021":51,"2022":59},{"2020":443,"2021":387,"2022":54},{"code":657,"data":658,"meta":26},"SUCCESS",{"id":659,"createTime":660,"updateTime":661,"relativeEntities":662,"slug":663,"properties":664,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":669,"manageAffiliations":702,"indexDatabases":724,"url":26,"thumbnailPath":26,"statistic":767,"gsStatistic":26,"type":175,"analyzePriority":26},"2bf7737b-5f9c-4b74-b81e-dd84d16d8989","2024-04-10T00:00:23.344+00:00","2025-11-21T10:01:09.757+00:00",[],"computational-complexity",{"issn":665,"title":667},{"VOID":666},"14208954",{"VOID":668},"computational complexity",[670,678,686,694],{"id":671,"createTime":672,"updateTime":673,"relativeEntities":674,"label":675,"description":677,"parentId":26,"standard":26,"scholarHubFieldId":26},"37634bef-3565-4ad6-b1ba-c43cf4d196be","2023-05-29T10:24:10.937+00:00","2023-11-21T07:37:14.631+00:00",[],{"EN":676},"Mathematics (miscellaneous)",{},{"id":679,"createTime":680,"updateTime":681,"relativeEntities":682,"label":683,"description":685,"parentId":26,"standard":26,"scholarHubFieldId":26},"e8c4e2fa-b139-4154-a158-595bd93d381c","2023-05-29T10:24:07.692+00:00","2023-11-21T07:15:31.396+00:00",[],{"EN":684},"Computational Theory and Mathematics",{},{"id":687,"createTime":688,"updateTime":689,"relativeEntities":690,"label":691,"description":693,"parentId":26,"standard":26,"scholarHubFieldId":26},"cfe20487-5108-4c23-a284-2aedca5fb76d","2023-05-29T10:24:09.965+00:00","2023-11-21T05:15:17.277+00:00",[],{"EN":692},"Theoretical Computer Science",{},{"id":695,"createTime":696,"updateTime":697,"relativeEntities":698,"label":699,"description":701,"parentId":26,"standard":26,"scholarHubFieldId":26},"0bfb7244-5877-4f77-9f03-0a51be00abe5","2023-05-29T10:24:11.016+00:00","2023-11-21T08:08:48.004+00:00",[],{"EN":700},"Computational Mathematics",{},[703,714],{"id":704,"createTime":705,"updateTime":706,"relativeEntities":707,"slug":708,"properties":709,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":158,"url":26,"parentIds":712,"statistic":26},"139e2cb2-b3dd-4445-9157-27e5743908bf","2023-05-29T12:07:35.939+00:00","2025-11-21T09:57:09.089+00:00",[],"SPRINGER-BASEL-AG",{"title":710},{"EN":711},"SPRINGER BASEL AG",[713],"9a7c7208-b28a-42c2-a634-5a7f90eee3ab",{"id":715,"createTime":716,"updateTime":717,"relativeEntities":718,"slug":719,"properties":720,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":50,"url":26,"parentIds":723,"statistic":26},"6b6d905e-ee3b-40e9-b9be-ea0ba247ee01","2023-05-29T10:26:08.524+00:00","2025-11-21T10:03:03.904+00:00",[],"Birkhauser-Verlag-Basel",{"title":721},{"EN":722},"Birkhauser Verlag Basel",[],[725,745],{"id":726,"indexDatabase":727,"url":741,"indexYears":26,"academicFieldIds":742,"indexDatabaseRanking":26},"b824e060-5111-44e2-b6f1-c9ec7f1f14c6",{"id":728,"createTime":729,"updateTime":730,"relativeEntities":731,"label":732,"description":734,"key":737,"publicationTags":738,"standard":26},"a4921856-b128-4d9f-8f1f-e80813d3bbd4","2023-05-22T09:59:31.026+00:00","2025-11-21T10:07:52.153+00:00",[],{"EN":733,"VI":733},"ISI\u002FSCIE - Science Citation Index Expanded",{"VI":735,"EN":736},"Cơ sở dữ liệu SCIE","SCIE database","scie",[739,740],"SCIE","ISI","https:\u002F\u002Fmjl.clarivate.com\u002Fsearch-results?issn=1016-3328",[743,744],"874c55e0-262a-4246-b3d1-85e02c3c09db","a410dee4-fcd0-43bf-ac42-c2f733ee737f",{"id":746,"indexDatabase":747,"url":759,"indexYears":760,"academicFieldIds":761,"indexDatabaseRanking":766},"9b09a7d1-11e3-4606-afca-83419fa683d8",{"id":748,"createTime":749,"updateTime":750,"relativeEntities":751,"label":752,"description":754,"key":756,"publicationTags":757,"standard":26},"3c7051d4-eb7d-4c57-a56b-36fc74c5d1e9","2023-05-22T09:57:18.509+00:00","2025-11-21T10:07:52.274+00:00",[],{"EN":753,"VI":753},"Scopus - Elsevier",{"EN":753,"VI":755},"Cơ sở dữ liệu Scopus thuộc Elsevier","scopus",[758],"SCOPUS","https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F28455","1991-1996,1998-2025",[762,763,764,765],"bccef185-f7d5-4f2e-881a-2dc383ea6c57","0ae9247a-0be3-46d8-a17e-488fa168abcc","8f050cfc-6be8-4218-91ba-e890405f0438","825d41e1-f1f9-472e-aa11-78b85d501870","SCOPUS__Q1",{"impactFactor":36,"impactFactorByYear":768,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":115,"totalPublicationByYear":769,"totalCitation":36,"totalCitationByYear":770,"totalCitationPerPublication":36,"totalCitationPerPublicationByYear":771,"hindexLast5Year":36,"hindex":36},{},{"2008":115},{},{},{"meta":773,"data":775},{"total":774},"344",[776,962,1123,1301,1527,1598,1672,1763,1914,2013],{"id":777,"createTime":778,"updateTime":779,"relativeEntities":780,"slug":781,"properties":782,"entityType":793,"verifyStatus":25,"verifyTime":779,"verifyNote":794,"syncStatus":28,"languages":795,"translateLanguages":26,"viewCount":36,"primaryUrl":796,"fullTextUrl":26,"authors":797,"publicationType":832,"publisherRelationship":833,"citationCount":868,"citationInfo":869,"publishDate":871,"publishYear":872,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":873,"isForceReanalyzing":961},"f4bac7c1-9f6f-4e00-a667-646fbc688a9a","2024-04-18T07:39:12.465+00:00","2025-02-02T07:26:06.128+00:00",[],"On-the-power-of-small-depth-threshold-circuits",{"mag":783,"keywords":785,"openalex":786,"abstract":788,"title":789,"doi":791},{"VOID":784},"2107998050",{},{"VOID":787},"W2107998050",{},{"EN":790},"On the power of small-depth threshold circuits",{"VOID":792},"10.1007\u002Fbf01272517","PUBLICATION","Auto Verify",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002FBF01272517",[798,817],{"id":799,"sortIndex":36,"researcher":26,"roles":800,"affiliations":801,"properties":812},"7b83b50e-b5d0-4ec8-9134-211606b30477",[],[802],{"id":803,"sortIndex":36,"affiliation":804,"properties":26},"083a7db5-b994-49de-93e1-5a1c2940479e",{"id":805,"createTime":806,"updateTime":806,"relativeEntities":807,"slug":808,"properties":809,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"89bb1dfe-305e-4d38-8926-976d9584dd63","2024-04-18T07:39:12.502+00:00",[],"Dept-of-Numerical-Analysis-and-Computing-Science-Royal-Institute-of-Technology-Stockholm-Sweden-TAB-",{"title":810},{"EN":811},"Dept. of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm, Sweden#TAB#",{"openalex":813,"title":815},{"VOID":814},"A5013166918",{"EN":816},"Johan Håstad",{"id":818,"sortIndex":115,"researcher":26,"roles":819,"affiliations":820,"properties":827},"1913ffb7-30b8-466c-9c7b-4ef8a93a3180",[],[821],{"id":822,"sortIndex":36,"affiliation":823,"properties":26},"f96cf95b-c4df-4ddd-b64e-e65dea0eb233",{"id":805,"createTime":806,"updateTime":806,"relativeEntities":824,"slug":808,"properties":825,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":826},{"EN":811},{"openalex":828,"title":830},{"VOID":829},"A5089425353",{"EN":831},"Mikael Goldmann","ARTICLE",{"url":26,"publisher":834,"properties":861},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":835,"slug":663,"properties":836,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":839,"manageAffiliations":840,"indexDatabases":841,"url":26,"thumbnailPath":26,"statistic":856,"gsStatistic":26,"type":175,"analyzePriority":26},[],{"issn":837,"title":838},{"VOID":666},{"VOID":668},[],[],[842,849],{"id":746,"indexDatabase":843,"url":759,"indexYears":760,"academicFieldIds":848,"indexDatabaseRanking":766},{"id":748,"createTime":749,"updateTime":750,"relativeEntities":844,"label":845,"description":846,"key":756,"publicationTags":847,"standard":26},[],{"EN":753,"VI":753},{"EN":753,"VI":755},[758],[762,763,764,765],{"id":726,"indexDatabase":850,"url":741,"indexYears":26,"academicFieldIds":855,"indexDatabaseRanking":26},{"id":728,"createTime":729,"updateTime":730,"relativeEntities":851,"label":852,"description":853,"key":737,"publicationTags":854,"standard":26},[],{"EN":733,"VI":733},{"VI":735,"EN":736},[739,740],[743,744],{"impactFactor":36,"impactFactorByYear":857,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":115,"totalPublicationByYear":858,"totalCitation":36,"totalCitationByYear":859,"totalCitationPerPublication":36,"totalCitationPerPublicationByYear":860,"hindexLast5Year":36,"hindex":36},{},{"2008":115},{},{},{"volume":862,"pages":864,"issue":866},{"VOID":863},"1",{"VOID":865},"113-129",{"VOID":867},"2",237,{"total":868,"publishYear":26,"statisticByYear":870},{"2012":298,"2013":336,"2014":298,"2015":103,"2016":116,"2017":158,"2018":336,"2019":51,"2020":111,"2021":162,"2022":158,"2023":111},"1991-06-01",1991,[874,878,882,886,889,893,897,901,905,909,912,916,920,924,928,932,935,938,942,946,950,954,958],{"id":26,"text":875,"url":26,"identifiers":876},"M. Ajtai. ? 1 1 on finite structures.Annals of Pure and Applied Logic, 24:1?48, 1983.",{"doi":877},"10.1016\u002F0168-0072(83)90038-6",{"id":26,"text":879,"url":26,"identifiers":880},"E. Allender. A note on the power of threshold circuits.Proceedings 30'th Annual Symposium on Foundations of Computer Science, pages 580?584, 1989.",{"doi":881},"10.1109\u002FSFCS.1989.63538",{"id":26,"text":883,"url":26,"identifiers":884},"N. Alon and R. B. Boppana. The monotone circuit complexity of boolean functions.Combinatorica, 7:1?22, 1987.",{"doi":885},"10.1007\u002FBF02579196",{"id":26,"text":887,"url":26,"identifiers":888},"A. E. Andreev. On a method for obtaining lower bounds for the complexity of individual monotone functions.Dokl. Ak. Nauk. SSSR 282, pages 1033?1037, 1985. English translation inSov. Math. Dokl., 31:530?534, 1985.",{},{"id":26,"text":890,"url":26,"identifiers":891},"L. Babai, N. Nisan, and M. Szegedy. Multipary protocols and logspacehard pseudorandom sequences.Proceedings of 21 st Annual ACM Symposium on Theory of Computing, pages 1?11, 1989.",{"doi":892},"10.1145\u002F73007.73008",{"id":26,"text":894,"url":26,"identifiers":895},"P. W. Beame, S. A. Cook, and H. J. Hoover. Log depth circuits for division and related problems.Proceedings 25'th Annual Symposium on Foundations of Computer Science, pages 1?6, 1984.",{"doi":896},"10.1109\u002FSFCS.1984.715894",{"id":26,"text":898,"url":26,"identifiers":899},"A. Chandra, L. Stockmeyer, and U. Vishkin. Constant depth reducibility.SIAM J. on Computing, 13:423?439, 1984.",{"doi":900},"10.1137\u002F0213028",{"id":26,"text":902,"url":26,"identifiers":903},"B. Chor and O. Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity.SIAM J. on Computing, 17:230?261, 1988.",{"doi":904},"10.1137\u002F0217015",{"id":26,"text":906,"url":26,"identifiers":907},"M. Furst, J. Saxe, and M. Sipser. Parity, circuits, and the polynomial time hierarchy.Math. System Theory, 17:13?27, 1984.",{"doi":908},"10.1007\u002FBF01744431",{"id":26,"text":910,"url":26,"identifiers":911},"J. Hastad.Computational Limitations of Small-Depth Circuits. MIT PRESS, 1986.",{},{"id":26,"text":913,"url":26,"identifiers":914},"J. Hastad and M. Goldmann. On the power of small-depth threshold circuits.Proceedings 31st Annual IEEE Symposium on Foundations of Computer Science, pages 610?618, 1990.",{"doi":915},"10.1109\u002FFSCS.1990.89582",{"id":26,"text":917,"url":26,"identifiers":918},"A. Hajnal, W. Maass, P. Pudlak, M. Szegedy, and G. Turán. Threshold circuits of bounded depth.Proceedings 28th Annual IEEE Symposium on Foundation of computer science, pages 99?110, 1987.",{"doi":919},"10.1109\u002FSFCS.1987.59",{"id":26,"text":921,"url":26,"identifiers":922},"M. Karchmer and A. Wigderson. Monotone circuits for connectivity require super-logarithmic depth. InProceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988.",{"doi":923},"10.1145\u002F62212.62265",{"id":26,"text":925,"url":26,"identifiers":926},"R. Raz and A. Wigderson. Probabilistic communication complexity of boolean relations. InProceedings of the 30th Annual IEEE Symposium on Foundation of computer science, pages 562?567, 1989.",{"doi":927},"10.1109\u002FSFCS.1989.63535",{"id":26,"text":929,"url":26,"identifiers":930},"R. Raz and A. Wigderson. Monotone circuits for matching require linear depth.22nd annual ACM Symposium on Theory of Computing, pages 287?292, 1990.",{"doi":931},"10.1145\u002F100216.100253",{"id":26,"text":933,"url":26,"identifiers":934},"A. A. Razborov. Lower bounds on monotone network complexity of the logical permanent.Matem. Zam., 37(6):887?900, 1985. English translation inMath. Notes of the Academy of Sciences of the USSR, 37:485?493, 1985.",{},{"id":26,"text":936,"url":26,"identifiers":937},"A. A. Razborov. Lower bounds on the size of bounded-depth networks over a complete basis with logical addition.Mathematical Notes of the Academy of Sciences of the USSR, 41(4):598?607, 1987. English translation in 41:4, pages 333?338.",{},{"id":26,"text":939,"url":26,"identifiers":940},"M. Sipser. Borel sets and circuit complexity. InProceedings of 15th Annual ACM Symposium on Theory of Computing, pages 61?69, 1983.",{"doi":941},"10.1145\u002F800061.808733",{"id":26,"text":943,"url":26,"identifiers":944},"R. Smolensky. Algebraic methods in the theory of lower bounds for boolean circuit complexity.Proceedings of 19th Annual ACM Symposium on Theory of Computing, pages 77?82, 1987.",{"doi":945},"10.1145\u002F28395.28404",{"id":26,"text":947,"url":26,"identifiers":948},"S. Toda. On the computational power ofPP and ?P. Proceedings 30th Annual IEEE Symposium on Foundations of Computer Science, pages 514?519, 1989.",{"doi":949},"10.1109\u002FSFCS.1989.63527",{"id":26,"text":951,"url":26,"identifiers":952},"A. Yao. Separating the polynomial-time hierarchy by oracles.Proceedings 26th Annual IEEE Symposium on Foundations of Computer Science, pages 1?10, 1985.",{"doi":953},"10.1109\u002FSFCS.1985.49",{"id":26,"text":955,"url":26,"identifiers":956},"A. Yao. Circuits and local computation.Proceedings of 21 st Annual ACM Symposium on Theory of Computing, pages 186?196, 1989.",{"doi":957},"10.1145\u002F73007.73025",{"id":26,"text":959,"url":26,"identifiers":960},"A. Yao. OnACC and threshold circuits.Proceedings 31 st Annual IEEE Symposium on Foundations of Computer Science, pages 619?627, 1990.",{},false,{"id":963,"createTime":964,"updateTime":965,"relativeEntities":966,"slug":967,"properties":968,"entityType":793,"verifyStatus":25,"verifyTime":965,"verifyNote":794,"syncStatus":28,"languages":979,"translateLanguages":26,"viewCount":36,"primaryUrl":980,"fullTextUrl":26,"authors":981,"publicationType":832,"publisherRelationship":1087,"citationCount":1115,"citationInfo":1116,"publishDate":1118,"publishYear":1119,"citationAnalyzeStatus":1120,"lastCitationAnalyze":1121,"indexDatabases":26,"openAccess":26,"references":1122,"isForceReanalyzing":961},"11baf8c3-5bb7-4edf-946f-2318ce399584","2024-04-14T08:23:47.915+00:00","2025-01-03T00:19:43.097+00:00",[],"ON-THE-HARDNESS-OF-APPROXIMATING-MULTICUT-AND-SPARSEST-CUT",{"mag":969,"keywords":971,"openalex":972,"abstract":974,"title":975,"doi":977},{"VOID":970},"2161719898",{},{"VOID":973},"W2161719898",{},{"EN":976},"ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT",{"VOID":978},"10.1007\u002Fs00037-006-0210-9",[102],"https:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs00037-006-0210-9",[982,1005,1024,1043,1068],{"id":983,"sortIndex":115,"researcher":26,"roles":984,"affiliations":985,"properties":1000},"9669ee27-ac02-49bc-ae03-ae3af482a19e",[],[986],{"id":987,"sortIndex":36,"affiliation":988,"properties":997},"d0f25a33-764c-43f9-9f0a-406a43241a2c",{"id":989,"createTime":990,"updateTime":991,"relativeEntities":992,"slug":993,"properties":994,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"a579eaea-b228-4a72-90ef-0c6b45b97178","2024-10-10T22:22:26.416+00:00","2024-12-24T08:10:25.873+00:00",[],"IBM-Almaden-Research-Center-650-Harry-Road-San-Jose-CA-95120-United-States-",{"title":995},{"EN":996},"IBM Almaden Research Center, 650 Harry Road, San Jose, CA 95120 (United States)",{"title":998},{"EN":999},"IBM Almaden Research Center, 650 Harry Road, San Jose, CA, 95120, U.S.A",{"openalex":1001,"title":1003},{"VOID":1002},"A5037378898",{"EN":1004},"Robert Krauthgamer",{"id":1006,"sortIndex":114,"researcher":26,"roles":1007,"affiliations":1008,"properties":1017},"8f89a0da-71c6-4d3d-b8c9-97371d9fb38c",[],[1009],{"id":1010,"sortIndex":36,"affiliation":1011,"properties":1015},"bc45d993-8e1d-4852-bc09-0c8036b414a2",{"id":989,"createTime":990,"updateTime":991,"relativeEntities":1012,"slug":993,"properties":1013,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1014},{"EN":996},{"title":1016},{"EN":999},{"openalex":1018,"orcid":1020,"title":1022},{"VOID":1019},"A5054728820",{"VOID":1021},"https:\u002F\u002Forcid.org\u002F0000-0001-7150-8977",{"EN":1023},"Ravi Kumar",{"id":1025,"sortIndex":59,"researcher":26,"roles":1026,"affiliations":1027,"properties":1036},"aa18619c-051f-40b7-b9fb-6ffc50528602",[],[1028],{"id":26,"sortIndex":36,"affiliation":1029,"properties":26},{"id":1030,"createTime":1031,"updateTime":1031,"relativeEntities":1032,"slug":26,"properties":1033,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"ed8a9a55-f64c-4f7d-90a7-ece4b6df5f0e","2023-12-30T20:43:54.770+00:00",[],{"title":1034},{"VI":1035},"Computer Science Department, Technion—Israel Institute of Technology, Haifa 32000, Israel",{"openalex":1037,"orcid":1039,"title":1041},{"VOID":1038},"A5010842984",{"VOID":1040},"https:\u002F\u002Forcid.org\u002F0000-0001-7772-2544",{"EN":1042},"Yuval Rabani",{"id":1044,"sortIndex":36,"researcher":26,"roles":1045,"affiliations":1046,"properties":1061},"dd380fea-6988-41ba-8b4e-e60e74d74258",[],[1047],{"id":1048,"sortIndex":36,"affiliation":1049,"properties":1058},"40447ac1-f7a5-4476-b895-48a9abf272a9",{"id":1050,"createTime":1051,"updateTime":1052,"relativeEntities":1053,"slug":1054,"properties":1055,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"357de2f2-2f3a-41ee-9f4c-22c885d7ebb8","2023-12-28T12:40:42.369+00:00","2024-08-31T23:16:45.083+00:00",[],"Computer-Science-Department-Carnegie-Mellon-University-Pittsburgh-PA-15213-USA",{"title":1056},{"VI":1057},"Computer Science Department, Carnegie Mellon University, Pittsburgh, PA 15213, USA",{"title":1059},{"EN":1060},"Computer Science Department, Carnegie Mellon University, Pittsburgh, PA, 15213, U.S.A",{"openalex":1062,"orcid":1064,"title":1066},{"VOID":1063},"A5005407267",{"VOID":1065},"https:\u002F\u002Forcid.org\u002F0000-0001-5583-2320",{"EN":1067},"Shuchi Chawla",{"id":1069,"sortIndex":111,"researcher":26,"roles":1070,"affiliations":1071,"properties":1080},"a4bb1763-7cd5-44f1-9106-647d48b98bf4",[],[1072],{"id":1073,"sortIndex":36,"affiliation":1074,"properties":1078},"325e139b-f554-404f-9750-928516b88257",{"id":989,"createTime":990,"updateTime":991,"relativeEntities":1075,"slug":993,"properties":1076,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1077},{"EN":996},{"title":1079},{"EN":999},{"openalex":1081,"orcid":1083,"title":1085},{"VOID":1082},"A5034629063",{"VOID":1084},"https:\u002F\u002Forcid.org\u002F0000-0002-1396-7849",{"EN":1086},"D. Sivakumar",{"url":26,"publisher":1088,"properties":26},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1089,"slug":663,"properties":1090,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1093,"manageAffiliations":1094,"indexDatabases":1095,"url":26,"thumbnailPath":26,"statistic":1110,"gsStatistic":26,"type":175,"analyzePriority":26},[],{"issn":1091,"title":1092},{"VOID":666},{"VOID":668},[],[],[1096,1103],{"id":746,"indexDatabase":1097,"url":759,"indexYears":760,"academicFieldIds":1102,"indexDatabaseRanking":766},{"id":748,"createTime":749,"updateTime":750,"relativeEntities":1098,"label":1099,"description":1100,"key":756,"publicationTags":1101,"standard":26},[],{"EN":753,"VI":753},{"EN":753,"VI":755},[758],[762,763,764,765],{"id":726,"indexDatabase":1104,"url":741,"indexYears":26,"academicFieldIds":1109,"indexDatabaseRanking":26},{"id":728,"createTime":729,"updateTime":730,"relativeEntities":1105,"label":1106,"description":1107,"key":737,"publicationTags":1108,"standard":26},[],{"EN":733,"VI":733},{"VI":735,"EN":736},[739,740],[743,744],{"impactFactor":36,"impactFactorByYear":1111,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":115,"totalPublicationByYear":1112,"totalCitation":36,"totalCitationByYear":1113,"totalCitationPerPublication":36,"totalCitationPerPublicationByYear":1114,"hindexLast5Year":36,"hindex":36},{},{"2008":115},{},{},195,{"total":1115,"publishYear":26,"statisticByYear":1117},{"2012":116,"2013":51,"2014":336,"2015":53,"2016":53,"2017":162,"2018":336,"2019":158,"2020":52,"2021":158,"2022":124,"2023":59,"2024":59},"2006-06-01",2006,"ERROR_IN_ANALYZE_CITATION","2024-04-14T20:21:06.595+00:00",[],{"id":1124,"createTime":1125,"updateTime":1126,"relativeEntities":1127,"slug":1128,"properties":1129,"entityType":793,"verifyStatus":25,"verifyTime":1126,"verifyNote":794,"syncStatus":28,"languages":1140,"translateLanguages":26,"viewCount":36,"primaryUrl":1141,"fullTextUrl":26,"authors":1142,"publicationType":832,"publisherRelationship":1162,"citationCount":1190,"citationInfo":1191,"publishDate":1193,"publishYear":1194,"citationAnalyzeStatus":1120,"lastCitationAnalyze":1195,"indexDatabases":26,"openAccess":26,"references":1196,"isForceReanalyzing":961},"9be78c35-1dcb-4973-9b69-48704d142b06","2024-04-11T16:37:53.247+00:00","2025-01-14T18:15:50.758+00:00",[],"The-hardness-of-approximation-Gap-location",{"mag":1130,"keywords":1132,"openalex":1133,"abstract":1135,"title":1136,"doi":1138},{"VOID":1131},"3161056635",{},{"VOID":1134},"W3161056635",{},{"EN":1137},"The hardness of approximation: Gap location",{"VOID":1139},"10.1007\u002Fbf01202286",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002FBF01202286",[1143],{"id":1144,"sortIndex":36,"researcher":26,"roles":1145,"affiliations":1146,"properties":1155},"5908d27a-e872-4a59-b958-41773a8ae648",[],[1147],{"id":26,"sortIndex":36,"affiliation":1148,"properties":26},{"id":1149,"createTime":1150,"updateTime":1150,"relativeEntities":1151,"slug":26,"properties":1152,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"85aa4e50-fd1e-434d-8ffd-d2df1027d700","2023-12-14T12:03:16.638+00:00",[],{"title":1153},{"VI":1154},"Department of Computer Science, Technion - Israel Institute of Technology, Technion City, Haifa, Israel",{"openalex":1156,"orcid":1158,"title":1160},{"VOID":1157},"A5073517584",{"VOID":1159},"https:\u002F\u002Forcid.org\u002F0000-0002-6353-956X",{"EN":1161},"Erez Petrank",{"url":26,"publisher":1163,"properties":26},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1164,"slug":663,"properties":1165,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1168,"manageAffiliations":1169,"indexDatabases":1170,"url":26,"thumbnailPath":26,"statistic":1185,"gsStatistic":26,"type":175,"analyzePriority":26},[],{"issn":1166,"title":1167},{"VOID":666},{"VOID":668},[],[],[1171,1178],{"id":746,"indexDatabase":1172,"url":759,"indexYears":760,"academicFieldIds":1177,"indexDatabaseRanking":766},{"id":748,"createTime":749,"updateTime":750,"relativeEntities":1173,"label":1174,"description":1175,"key":756,"publicationTags":1176,"standard":26},[],{"EN":753,"VI":753},{"EN":753,"VI":755},[758],[762,763,764,765],{"id":726,"indexDatabase":1179,"url":741,"indexYears":26,"academicFieldIds":1184,"indexDatabaseRanking":26},{"id":728,"createTime":729,"updateTime":730,"relativeEntities":1180,"label":1181,"description":1182,"key":737,"publicationTags":1183,"standard":26},[],{"EN":733,"VI":733},{"VI":735,"EN":736},[739,740],[743,744],{"impactFactor":36,"impactFactorByYear":1186,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":115,"totalPublicationByYear":1187,"totalCitation":36,"totalCitationByYear":1188,"totalCitationPerPublication":36,"totalCitationPerPublicationByYear":1189,"hindexLast5Year":36,"hindex":36},{},{"2008":115},{},{},183,{"total":1190,"publishYear":26,"statisticByYear":1192},{"2012":135,"2013":135,"2014":50,"2015":111,"2016":162,"2018":158,"2019":135,"2020":116,"2021":111,"2022":162,"2023":111,"2024":115},"1994-06-01",1994,"2024-04-11T19:23:29.993+00:00",[1197,1201,1205,1209,1213,1216,1219,1223,1227,1231,1234,1238,1242,1245,1249,1253,1257,1261,1265,1269,1272,1276,1279,1282,1286,1290,1293,1297],{"id":26,"text":1198,"url":26,"identifiers":1199},"M. Ajtai, Recursive Construction for 3-Regular Expanders. InProc. 28th Ann. Symp. Found. Comput. Sci., 1987, 295?304.",{"doi":1200},"10.1109\u002FSFCS.1987.50",{"id":26,"text":1202,"url":26,"identifiers":1203},"N. Alon, R. A. Duke, H. Lefmann, V. Rödl, and R. Yuster, The Algorithmic Aspects of the Regularity Lemma. InProc. 33th Ann. Symp. Found. Comput. Sci., 1992, 473?482.",{"doi":1204},"10.1109\u002FSFCS.1992.267804",{"id":26,"text":1206,"url":26,"identifiers":1207},"S. Arora and S. Safra, Probabilistic Checking of Proofs: A New Characterization of NP. InProc. 33th Ann. Symp. Found. Comput. Sci., 1992, 1?13.",{"doi":1208},"10.1109\u002FSFCS.1992.267824",{"id":26,"text":1210,"url":26,"identifiers":1211},"S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof Verification and Intractability of Approximation Problems. InProc. 33th Ann. Symp. Found. Comput. Sci., 1992, 14?23.",{"doi":1212},"10.1109\u002FSFCS.1992.267823",{"id":26,"text":1214,"url":26,"identifiers":1215},"M. Bellare and E. Petrank, private communication, 1992.",{},{"id":26,"text":1217,"url":26,"identifiers":1218},"C. Berge,Graph and Hypergraphs. North-Holland, Amsterdam, 1973.",{},{"id":26,"text":1220,"url":26,"identifiers":1221},"M. Bern andP. Plassmann, The Steiner problem with edge lengths 1 and 2.Inform. Process. Lett. 32 (1989), 171?176.",{"doi":1222},"10.1016\u002F0020-0190(89)90039-2",{"id":26,"text":1224,"url":26,"identifiers":1225},"A. Blum, T. Jiang, M. Li, J. Tromp, and M. Yannakakis, Linear Approximation of Shortest Superstrings. InProc. 31th Ann. Symp. Found. Comput. Sci., 1990, 554?562.",{"doi":1226},"10.1145\u002F103418.103455",{"id":26,"text":1228,"url":26,"identifiers":1229},"E. Dahlhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, and M. Yannakakis, The Complexity of Multiway Cuts. InProc. Twenty-forth Ann. ACM Symp. Theor. Comput., 1992, 241?251.",{"doi":1230},"10.1145\u002F129712.129736",{"id":26,"text":1232,"url":26,"identifiers":1233},"U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy, Approximating clique is almost NP-complete. InProc. 32th Ann. Symp. Found. Comput. Sci., 1991, 2?12.",{},{"id":26,"text":1235,"url":26,"identifiers":1236},"O. Gabber andZ. Galil, Explicit Construction of linear sized superconcentrators.J. Comput. System Sci. 22 (1981), 407?420.",{"doi":1237},"10.1016\u002F0022-0000(81)90040-4",{"id":26,"text":1239,"url":26,"identifiers":1240},"M. R. Garey andD. S. Johnson, The complexity of near-optimal graph coloring.J. Assoc. Comput. Mach. 23 (1976), 43?49.",{"doi":1241},"10.1145\u002F321921.321926",{"id":26,"text":1243,"url":26,"identifiers":1244},"M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.",{},{"id":26,"text":1246,"url":26,"identifiers":1247},"M. R. Garey, D. S. Johnson, andL. J. Stockmeyer, Some Simplified NP-Complete Graph Problems.Theoret. Comput. Sci. 1 (1976), 237?267.",{"doi":1248},"10.1016\u002F0304-3975(76)90059-1",{"id":26,"text":1250,"url":26,"identifiers":1251},"J. Hastad, S. Phillips, and S. Safra, A well Characterized Approximation Problem. InProceedings of the 2nd Israel Symposium on Theory of Computing and Systems, 1993, 261?265.",{"doi":1252},"10.1109\u002FISTCS.1993.253463",{"id":26,"text":1254,"url":26,"identifiers":1255},"I. Hoyler, The NP-Competeness of Edge Coloring.SIAM J. Comput. 10 (1981), 718?720.",{"doi":1256},"10.1137\u002F0210055",{"id":26,"text":1258,"url":26,"identifiers":1259},"V. Kann Maximum Bounded 3-Dimensional Matching is MAX SNP-Complete.Inform. Process. Lett. 37 (1991), 27?35.",{"doi":1260},"10.1016\u002F0020-0190(91)90246-E",{"id":26,"text":1262,"url":26,"identifiers":1263},"R. M. Karp, Reducibility among combinatorial problems. InComplexity of Computer Computations, ed.Raymond E. Miller and James W. Thatcher, Plenum Press, 1972, 85?103.",{"doi":1264},"10.1007\u002F978-1-4684-2001-2_9",{"id":26,"text":1266,"url":26,"identifiers":1267},"D. Leven andZ. Galil, NP-completness of finding the chromatic index of regular graphs.J. Algorithms 4 (1983), 35?44.",{"doi":1268},"10.1016\u002F0196-6774(83)90032-9",{"id":26,"text":1270,"url":26,"identifiers":1271},"L. Lovász, Coverings and Colorings of Hypergraphs. InProc. 4-th Southern Conference on Combinatorics, Graph Theory, and Computing, Utilitas Mathematica Publishing, 1973, 3?12.",{},{"id":26,"text":1273,"url":26,"identifiers":1274},"C. Lund and M. Yannakakis, On the Hardness of Approximating Minimization Problems. InProc. Twenty-fifth Ann. ACM Symp. Theor. Comput., 1993, 286?293.",{"doi":1275},"10.1145\u002F167088.167172",{"id":26,"text":1277,"url":26,"identifiers":1278},"G. A. Margulis, Explicit Constructions of Concentrators.Comm. ACM 9 (1973), 71?80. (English translation inProblems Inform. Transmission, 1975, 325?332.).",{},{"id":26,"text":1280,"url":26,"identifiers":1281},"R. Motwani, Lecture Notes on Approximation Algorithms. Technical report, Dept. of Computer Science, Stanford University, 1992.",{},{"id":26,"text":1283,"url":26,"identifiers":1284},"C. H. Papadimitriou andM. Yannakakis, Optimization, Approximation, and Complexity Classes.J. Comput. System Sci. 43 (1991), 425?440.",{"doi":1285},"10.1016\u002F0022-0000(91)90023-X",{"id":26,"text":1287,"url":26,"identifiers":1288},"C. H. Papadimitriou and M. Yannakakis, The Traveling Salesman Problem with Distances One and Two.Mathematics of Operations Research (to appear).",{"doi":1289},"10.1287\u002Fmoor.18.1.1",{"id":26,"text":1291,"url":26,"identifiers":1292},"E. Petrank, The Hardness of Approximation: Gap Location. InProceedings of the 2nd Israel Symposium on Theory of Computing and Systems, 1993, 275?284.",{},{"id":26,"text":1294,"url":26,"identifiers":1295},"S. Sahni andT. Gonzalez, P-complete approximation problems.J. Assoc. Comput. Mach. 23 (1976), 555?565.",{"doi":1296},"10.1145\u002F321958.321975",{"id":26,"text":1298,"url":26,"identifiers":1299},"L. J. Stockmeyer, Planar 3-Colorability is NP-Complete.SIGACT News 5(3) (1973), 19?25.",{"doi":1300},"10.1145\u002F1008293.1008294",{"id":1302,"createTime":1303,"updateTime":1304,"relativeEntities":1305,"slug":1306,"properties":1307,"entityType":793,"verifyStatus":25,"verifyTime":1304,"verifyNote":794,"syncStatus":28,"languages":1318,"translateLanguages":26,"viewCount":36,"primaryUrl":1319,"fullTextUrl":26,"authors":1320,"publicationType":832,"publisherRelationship":1402,"citationCount":1436,"citationInfo":1437,"publishDate":1439,"publishYear":1440,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":1441,"isForceReanalyzing":961},"dddbc71d-4229-44b0-86e9-ef190e2ea6a8","2024-04-19T08:32:18.351+00:00","2024-12-11T16:16:21.733+00:00",[],"Derandomized-graph-products",{"mag":1308,"keywords":1310,"openalex":1311,"abstract":1313,"title":1314,"doi":1316},{"VOID":1309},"2055656009",{},{"VOID":1312},"W2055656009",{},{"EN":1315},"Derandomized graph products",{"VOID":1317},"10.1007\u002Fbf01277956",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002FBF01277956",[1321,1343,1363,1382],{"id":1322,"sortIndex":115,"researcher":26,"roles":1323,"affiliations":1324,"properties":1336},"9481c282-de6a-45f7-87c8-c3c9c3b76509",[],[1325],{"id":1326,"sortIndex":36,"affiliation":1327,"properties":26},"331f0205-4924-464b-a1fc-8db4bb9e0fee",{"id":1328,"createTime":1329,"updateTime":1330,"relativeEntities":1331,"slug":1332,"properties":1333,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"b3060a91-cd04-43c3-8ce0-f12c5c187b23","2024-04-14T05:13:23.555+00:00","2024-12-30T03:11:29.000+00:00",[],"Weizmann-institute-of-science-",{"title":1334},{"EN":1335},"Weizmann institute of science;",{"openalex":1337,"orcid":1339,"title":1341},{"VOID":1338},"A5013190102",{"VOID":1340},"https:\u002F\u002Forcid.org\u002F0009-0006-3749-4392",{"EN":1342},"Uriel Feige",{"id":1344,"sortIndex":36,"researcher":26,"roles":1345,"affiliations":1346,"properties":1356},"be06f5d5-800f-4b1b-81b1-b6d889134671",[],[1347],{"id":1348,"sortIndex":36,"affiliation":1349,"properties":26},"dd5986f6-3fa0-4be8-bc76-e4afe2d5667a",{"id":1350,"createTime":1351,"updateTime":1351,"relativeEntities":1352,"slug":26,"properties":1353,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"1d3cd4ab-6b9d-466d-b715-c77280427225","2024-01-09T21:05:24.400+00:00",[],{"title":1354},{"VI":1355},"Department of Mathematics, Tel-Aviv University, Tel-Aviv, Israel",{"openalex":1357,"orcid":1359,"title":1361},{"VOID":1358},"A5083469386",{"VOID":1360},"https:\u002F\u002Forcid.org\u002F0000-0003-1332-4883",{"EN":1362},"Noga Alon",{"id":1364,"sortIndex":59,"researcher":26,"roles":1365,"affiliations":1366,"properties":1377},"f6a8826e-0f3d-40b5-81b7-f6f37d044a49",[],[1367],{"id":1368,"sortIndex":36,"affiliation":1369,"properties":26},"4cc29be9-dfcd-4ef5-b851-6872f1b9909f",{"id":1370,"createTime":1371,"updateTime":1371,"relativeEntities":1372,"slug":1373,"properties":1374,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"f0e747bc-ae97-4421-9ba3-e3028e07dccc","2024-04-19T08:32:18.408+00:00",[],"Dept-of-Computer-Sciences-University-of-Texas-at-Austin-Austin-USA",{"title":1375},{"EN":1376},"Dept. of Computer Sciences, University of Texas at Austin, Austin, USA",{"openalex":1378,"title":1380},{"VOID":1379},"A5052332525",{"EN":1381},"David Zuckerman",{"id":1383,"sortIndex":114,"researcher":26,"roles":1384,"affiliations":1385,"properties":1397},"53154024-27bf-435e-9d06-b733c0440cbe",[],[1386],{"id":1387,"sortIndex":36,"affiliation":1388,"properties":26},"ab980910-2845-482c-948a-b695b0bc7f0d",{"id":1389,"createTime":1390,"updateTime":1391,"relativeEntities":1392,"slug":1393,"properties":1394,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"ca428ad5-5468-461b-87d2-d46c67c93aab","2024-04-11T10:31:47.909+00:00","2025-01-29T16:58:41.383+00:00",[],"-Hebrew-university-of-Jerusalem-",{"title":1395},{"EN":1396},"[Hebrew university of Jerusalem]",{"openalex":1398,"title":1400},{"VOID":1399},"A5039043184",{"EN":1401},"Avi Wigderson",{"url":26,"publisher":1403,"properties":1430},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1404,"slug":663,"properties":1405,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1408,"manageAffiliations":1409,"indexDatabases":1410,"url":26,"thumbnailPath":26,"statistic":1425,"gsStatistic":26,"type":175,"analyzePriority":26},[],{"issn":1406,"title":1407},{"VOID":666},{"VOID":668},[],[],[1411,1418],{"id":746,"indexDatabase":1412,"url":759,"indexYears":760,"academicFieldIds":1417,"indexDatabaseRanking":766},{"id":748,"createTime":749,"updateTime":750,"relativeEntities":1413,"label":1414,"description":1415,"key":756,"publicationTags":1416,"standard":26},[],{"EN":753,"VI":753},{"EN":753,"VI":755},[758],[762,763,764,765],{"id":726,"indexDatabase":1419,"url":741,"indexYears":26,"academicFieldIds":1424,"indexDatabaseRanking":26},{"id":728,"createTime":729,"updateTime":730,"relativeEntities":1420,"label":1421,"description":1422,"key":737,"publicationTags":1423,"standard":26},[],{"EN":733,"VI":733},{"VI":735,"EN":736},[739,740],[743,744],{"impactFactor":36,"impactFactorByYear":1426,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":115,"totalPublicationByYear":1427,"totalCitation":36,"totalCitationByYear":1428,"totalCitationPerPublication":36,"totalCitationPerPublicationByYear":1429,"hindexLast5Year":36,"hindex":36},{},{"2008":115},{},{},{"volume":1431,"pages":1433,"issue":1435},{"VOID":1432},"5",{"VOID":1434},"60-75",{"VOID":863},135,{"total":1436,"publishYear":26,"statisticByYear":1438},{"2012":162,"2013":158,"2014":50,"2015":135,"2016":59,"2017":114,"2018":115,"2019":114,"2020":111,"2021":111,"2022":114,"2023":59},"1995-03-01",1995,[1442,1446,1450,1454,1458,1461,1464,1467,1470,1473,1477,1480,1484,1487,1490,1493,1497,1501,1504,1507,1511,1515,1518,1521,1524],{"id":26,"text":1443,"url":26,"identifiers":1444},"M. Ajtai, J. Komlós, and E. Szemerédi, Deterministic Simulation in Logspace.Proc. Nineteenth Ann. ACM Symp. Theor. Comput., 1987, 132?140.",{"doi":1445},"10.1145\u002F28395.28410",{"id":26,"text":1447,"url":26,"identifiers":1448},"N. Alon, Eigenvalues and expanders.Combinatorica 6 (1986), 83?96.",{"doi":1449},"10.1007\u002FBF02579166",{"id":26,"text":1451,"url":26,"identifiers":1452},"N. Alon andF. R. K. Chung, Explicit construction of linear sized tolerant networks.Discrete Math. 72 (1988), 15?19.",{"doi":1453},"10.1016\u002F0012-365X(88)90189-6",{"id":26,"text":1455,"url":26,"identifiers":1456},"E. Amaldi and V. Kann, The complexity and approximability of finding maximum feasible subsystems of linear relations.Theoret. Comput. Sci., to appear.",{"doi":1457},"10.1016\u002F0304-3975(94)00254-G",{"id":26,"text":1459,"url":26,"identifiers":1460},"S. Arora, L. Babai, J. Stern, and Z. Sweedyk, The Hardness of Approximate Optima in Lattices, Codes and Linear Equations.Proc. 34th Ann. IEEE Symp. Found. Comput. Sci., 1993, 724?733. (Final version submitted toJ. Comput. System Sci.)",{},{"id":26,"text":1462,"url":26,"identifiers":1463},"S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof Verification and Hardness of Approximation Problems.Proc. 33rd Ann. IEEE Symp. Found. Comput. Sci., 1992, 14?23.",{"doi":1212},{"id":26,"text":1465,"url":26,"identifiers":1466},"S. Arora and S. Safra, Probabilistic Checking of Proofs; A New Characterization of NP.Proc. 33rd Ann. IEEE Symp. Found. Comput. Sci., 1992, 2?13.",{"doi":1208},{"id":26,"text":1468,"url":26,"identifiers":1469},"M. Bellare, O. Goldreich, and S. Goldwasser, Randomness in Interactive Proofs.Proc. 31st Ann. IEEE Symp. Found. Comput. Sci., 1990, 563?572.",{},{"id":26,"text":1471,"url":26,"identifiers":1472},"P. Berman and M. Furer, Approximating maximum independent set in bounded degree graphs.Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, 1994, 365?371.",{},{"id":26,"text":1474,"url":26,"identifiers":1475},"P. Berman andG. Schnitger, On the Complexity of Approximating the Independent Set Problem.Inform. and Comput. 96 (1992), 77?94.",{"doi":1476},"10.1016\u002F0890-5401(92)90056-L",{"id":26,"text":1478,"url":26,"identifiers":1479},"A. Blum. Ph.D. dissertation, MIT.",{},{"id":26,"text":1481,"url":26,"identifiers":1482},"A. Cohen and A. Wigderson, Dispersers, deterministic amplification, and weak random sources.Proc. 30th Ann. IEEE Symp. Found. Comput. Sci., 1989, 14?19.",{"doi":1483},"10.1109\u002FSFCS.1989.63449",{"id":26,"text":1485,"url":26,"identifiers":1486},"U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy, Approximating Clique is Almost NP-complete.Proc. 32nd Ann. IEEE Symp. Found. Comput. Sci., 1991, 2?12.",{},{"id":26,"text":1488,"url":26,"identifiers":1489},"O. Gabber andZ. Galil, Explicit Constructions of Linear Sized Superconcentrators.J. Comput. System Sci. 22(3) (1981), 407?420.",{"doi":1237},{"id":26,"text":1491,"url":26,"identifiers":1492},"M. Garey andD. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.",{},{"id":26,"text":1494,"url":26,"identifiers":1495},"M. Halldorsson and J. Radhakrishnan, Greed is good: approximating independent sets in sparse and bounded-degree graphs.Proc. Twenty-sixth Ann. ACM Symp. Theor. Comput., 1994, 439?448.",{"doi":1496},"10.1145\u002F195058.195221",{"id":26,"text":1498,"url":26,"identifiers":1499},"R. Impagliazzo and D. Zuckerman, How to Recycle Random Bits.Proc. 30th Ann. IEEE Symp. Found. Comput. Sci., 1989, 248?253.",{"doi":1500},"10.1109\u002FSFCS.1989.63486",{"id":26,"text":1502,"url":26,"identifiers":1503},"N. Kahale, Better Expansion for Ramanujan Graphs.Proc. 33rd Ann. IEEE Symp. Found. Comput. Sci., 1992, 398?404.",{},{"id":26,"text":1505,"url":26,"identifiers":1506},"R. M. Karp, Reducibility Among Combinatorial Problems. InComplexity of Computer Computations, ed.R. Miller and J. Thatcher. Plenum Press, 1972, 85?103.",{"doi":1264},{"id":26,"text":1508,"url":26,"identifiers":1509},"N. Linial and U. Vazirani, Graph Products and Chromatic Numbers.Proc. 30th Ann. IEEE Symp. Found. Comput. Sci., 1989, 124?128.",{"doi":1510},"10.1109\u002FSFCS.1989.63466",{"id":26,"text":1512,"url":26,"identifiers":1513},"A. Lubotsky, R. Phillips andP. Sarnak, Ramanujan Graphs.Combinatorica 8(3) (1988), 261?277.",{"doi":1514},"10.1007\u002FBF02126799",{"id":26,"text":1516,"url":26,"identifiers":1517},"G. A. Margulis, Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and superconcentrators.Problemy Peredachi Informatsii 24 (1988), 51?60 (in Russian). English translation inProblems of Information Transmission 24 (1988), 39?46.",{},{"id":26,"text":1519,"url":26,"identifiers":1520},"M. Marcus andH. Minc,A Survey of Matrix Theory and Matrix Inequalities. Allyn and Bacon, Inc., Boston, 1964.",{},{"id":26,"text":1522,"url":26,"identifiers":1523},"C. Papadimitriou andM. Yannakakis, Optimization, Approximation, and Complexity Classes.J. Comput. System Sci. 43 (1991), 425?440.",{"doi":1285},{"id":26,"text":1525,"url":26,"identifiers":1526},"D. Zuckerman, Simulating BPP Using a General Weak Random Source.Proc. 32nd Ann. IEEE Symp. Found. Comput. Sci. 1991, 79?89.",{},{"id":1528,"createTime":1529,"updateTime":1529,"relativeEntities":1530,"slug":1531,"properties":1532,"entityType":793,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":1543,"translateLanguages":26,"viewCount":36,"primaryUrl":1544,"fullTextUrl":26,"authors":1545,"publicationType":832,"publisherRelationship":1564,"citationCount":1592,"citationInfo":1593,"publishDate":1595,"publishYear":1596,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":1597,"isForceReanalyzing":961},"bc4e547a-aaaa-46d3-b7e3-e170aaf511f4","2024-04-15T06:54:53.022+00:00",[],"Depth-3-arithmetic-circuits-over-fields-of-characteristic-zero",{"mag":1533,"keywords":1535,"openalex":1536,"abstract":1538,"title":1539,"doi":1541},{"VOID":1534},"2914183794",{},{"VOID":1537},"W2914183794",{},{"EN":1540},"Depth-3 arithmetic circuits over fields of characteristic zero",{"VOID":1542},"10.1007\u002Fpl00001609",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002FPL00001609",[1546,1553],{"id":1547,"sortIndex":115,"researcher":26,"roles":1548,"affiliations":1549,"properties":1550},"3986d8c0-9e8d-4057-9286-a7b34ff0a301",[],[],{"openalex":1551,"title":1552},{"VOID":1399},{"EN":1401},{"id":1554,"sortIndex":36,"researcher":26,"roles":1555,"affiliations":1556,"properties":1557},"100f133e-f93f-4dec-8085-b268e30e3374",[],[],{"openalex":1558,"orcid":1560,"title":1562},{"VOID":1559},"A5004182247",{"VOID":1561},"https:\u002F\u002Forcid.org\u002F0000-0003-2384-425X",{"EN":1563},"Amir Shpilka",{"url":26,"publisher":1565,"properties":26},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1566,"slug":663,"properties":1567,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1570,"manageAffiliations":1571,"indexDatabases":1572,"url":26,"thumbnailPath":26,"statistic":1587,"gsStatistic":26,"type":175,"analyzePriority":26},[],{"issn":1568,"title":1569},{"VOID":666},{"VOID":668},[],[],[1573,1580],{"id":746,"indexDatabase":1574,"url":759,"indexYears":760,"academicFieldIds":1579,"indexDatabaseRanking":766},{"id":748,"createTime":749,"updateTime":750,"relativeEntities":1575,"label":1576,"description":1577,"key":756,"publicationTags":1578,"standard":26},[],{"EN":753,"VI":753},{"EN":753,"VI":755},[758],[762,763,764,765],{"id":726,"indexDatabase":1581,"url":741,"indexYears":26,"academicFieldIds":1586,"indexDatabaseRanking":26},{"id":728,"createTime":729,"updateTime":730,"relativeEntities":1582,"label":1583,"description":1584,"key":737,"publicationTags":1585,"standard":26},[],{"EN":733,"VI":733},{"VI":735,"EN":736},[739,740],[743,744],{"impactFactor":36,"impactFactorByYear":1588,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":115,"totalPublicationByYear":1589,"totalCitation":36,"totalCitationByYear":1590,"totalCitationPerPublication":36,"totalCitationPerPublicationByYear":1591,"hindexLast5Year":36,"hindex":36},{},{"2008":115},{},{},98,{"total":1592,"publishYear":26,"statisticByYear":1594},{"2012":59,"2013":135,"2014":52,"2015":158,"2016":52,"2017":111,"2018":114,"2019":135,"2020":114,"2021":111,"2022":135,"2023":115,"2024":115},"2001-11-01",2001,[],{"id":1599,"createTime":1600,"updateTime":1601,"relativeEntities":1602,"slug":1603,"properties":1604,"entityType":793,"verifyStatus":25,"verifyTime":1601,"verifyNote":794,"syncStatus":28,"languages":1615,"translateLanguages":26,"viewCount":36,"primaryUrl":1616,"fullTextUrl":26,"authors":1617,"publicationType":832,"publisherRelationship":1637,"citationCount":1665,"citationInfo":1666,"publishDate":1668,"publishYear":1669,"citationAnalyzeStatus":1120,"lastCitationAnalyze":1670,"indexDatabases":26,"openAccess":26,"references":1671,"isForceReanalyzing":961},"f5b6be8f-aa50-4ebd-9a90-dd8b877fa573","2024-04-13T09:07:15.590+00:00","2025-01-13T08:52:54.569+00:00",[],"Towards-proving-strong-direct-product-theorems",{"mag":1605,"keywords":1607,"openalex":1608,"abstract":1610,"title":1611,"doi":1613},{"VOID":1606},"3157388067",{},{"VOID":1609},"W3157388067",{},{"EN":1612},"Towards proving strong direct product theorems",{"VOID":1614},"10.1007\u002Fs00037-003-0175-x",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs00037-003-0175-x",[1618],{"id":1619,"sortIndex":36,"researcher":26,"roles":1620,"affiliations":1621,"properties":1632},"075ca539-07da-4aeb-9cde-1ee5e59bd28f",[],[1622],{"id":26,"sortIndex":36,"affiliation":1623,"properties":26},{"id":1624,"createTime":1625,"updateTime":1626,"relativeEntities":1627,"slug":1628,"properties":1629,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"9d893fde-89f0-4482-99cf-0d0b8de8164b","2024-01-01T11:19:43.409+00:00","2024-10-07T08:54:31.306+00:00",[],"Department-of-Applied-Mathematics-and-Computer-Science-Weizmann-Institute-of-Science-Rehovot-Israel",{"title":1630},{"VI":1631},"Department of Applied Mathematics and Computer Science, Weizmann Institute of Science, Rehovot, Israel",{"openalex":1633,"title":1635},{"VOID":1634},"A5062263696",{"EN":1636},"Ronen Shaltiel",{"url":26,"publisher":1638,"properties":26},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1639,"slug":663,"properties":1640,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1643,"manageAffiliations":1644,"indexDatabases":1645,"url":26,"thumbnailPath":26,"statistic":1660,"gsStatistic":26,"type":175,"analyzePriority":26},[],{"issn":1641,"title":1642},{"VOID":666},{"VOID":668},[],[],[1646,1653],{"id":746,"indexDatabase":1647,"url":759,"indexYears":760,"academicFieldIds":1652,"indexDatabaseRanking":766},{"id":748,"createTime":749,"updateTime":750,"relativeEntities":1648,"label":1649,"description":1650,"key":756,"publicationTags":1651,"standard":26},[],{"EN":753,"VI":753},{"EN":753,"VI":755},[758],[762,763,764,765],{"id":726,"indexDatabase":1654,"url":741,"indexYears":26,"academicFieldIds":1659,"indexDatabaseRanking":26},{"id":728,"createTime":729,"updateTime":730,"relativeEntities":1655,"label":1656,"description":1657,"key":737,"publicationTags":1658,"standard":26},[],{"EN":733,"VI":733},{"VI":735,"EN":736},[739,740],[743,744],{"impactFactor":36,"impactFactorByYear":1661,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":115,"totalPublicationByYear":1662,"totalCitation":36,"totalCitationByYear":1663,"totalCitationPerPublication":36,"totalCitationPerPublicationByYear":1664,"hindexLast5Year":36,"hindex":36},{},{"2008":115},{},{},87,{"total":1665,"publishYear":26,"statisticByYear":1667},{"2012":53,"2013":50,"2014":115,"2015":53,"2016":111,"2017":59,"2019":162,"2020":52,"2021":162,"2022":115,"2023":114},"2003-06-01",2003,"2024-04-13T18:41:06.332+00:00",[],{"id":1673,"createTime":1674,"updateTime":1675,"relativeEntities":1676,"slug":1677,"properties":1678,"entityType":793,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":1689,"translateLanguages":26,"viewCount":36,"primaryUrl":1690,"fullTextUrl":26,"authors":1691,"publicationType":832,"publisherRelationship":1730,"citationCount":357,"citationInfo":1758,"publishDate":1760,"publishYear":1761,"citationAnalyzeStatus":1120,"lastCitationAnalyze":1675,"indexDatabases":26,"openAccess":26,"references":1762,"isForceReanalyzing":961},"22ce1875-5b65-4fa5-b8cb-26dc9bba470d","2024-04-11T10:43:26.709+00:00","2024-04-11T11:06:22.945+00:00",[],"Pseudorandomness-and-Average-Case-Complexity-Via-Uniform-Reductions",{"mag":1679,"keywords":1681,"openalex":1682,"abstract":1684,"title":1685,"doi":1687},{"VOID":1680},"1973874352",{},{"VOID":1683},"W1973874352",{},{"EN":1686},"Pseudorandomness and Average-Case Complexity Via Uniform Reductions",{"VOID":1688},"10.1007\u002Fs00037-007-0233-x",[102],"https:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs00037-007-0233-x",[1692,1710],{"id":1693,"sortIndex":36,"researcher":26,"roles":1694,"affiliations":1695,"properties":1705},"652ee1ef-76db-4ee5-a24b-69b78db4216d",[],[1696],{"id":26,"sortIndex":36,"affiliation":1697,"properties":26},{"id":1698,"createTime":1699,"updateTime":1699,"relativeEntities":1700,"slug":1701,"properties":1702,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"533df318-8cef-4e75-84b9-0150760f7d7f","2024-04-11T10:43:26.723+00:00",[],"Computer-Science-Division-University-of-California-at-Berkeley-679-Soda-Hall-Berkeley-CA-94720-1776-USA",{"title":1703},{"EN":1704},"Computer Science Division, University of California at Berkeley, 679 Soda Hall, Berkeley, CA, 94720-1776, USA",{"openalex":1706,"title":1708},{"VOID":1707},"A5063394341",{"EN":1709},"Luca Trevisan",{"id":1711,"sortIndex":115,"researcher":26,"roles":1712,"affiliations":1713,"properties":1723},"37e752aa-5772-456e-b004-75341b9b6ab6",[],[1714],{"id":26,"sortIndex":36,"affiliation":1715,"properties":26},{"id":1716,"createTime":1717,"updateTime":1717,"relativeEntities":1718,"slug":1719,"properties":1720,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"191911b4-d687-455e-b32f-03cdb3293fa4","2024-04-11T10:43:26.734+00:00",[],"School-of-Engineering-and-Applied-Sciences-Harvard-University-33-Oxford-Street-Cambridge-MA-02138-USA",{"title":1721},{"EN":1722},"School of Engineering and Applied Sciences, Harvard University, 33 Oxford Street, Cambridge, MA, 02138, USA",{"openalex":1724,"orcid":1726,"title":1728},{"VOID":1725},"A5016656677",{"VOID":1727},"https:\u002F\u002Forcid.org\u002F0000-0002-4059-4072",{"EN":1729},"Salil Vadhan",{"url":26,"publisher":1731,"properties":26},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1732,"slug":663,"properties":1733,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1736,"manageAffiliations":1737,"indexDatabases":1738,"url":26,"thumbnailPath":26,"statistic":1753,"gsStatistic":26,"type":175,"analyzePriority":26},[],{"issn":1734,"title":1735},{"VOID":666},{"VOID":668},[],[],[1739,1746],{"id":746,"indexDatabase":1740,"url":759,"indexYears":760,"academicFieldIds":1745,"indexDatabaseRanking":766},{"id":748,"createTime":749,"updateTime":750,"relativeEntities":1741,"label":1742,"description":1743,"key":756,"publicationTags":1744,"standard":26},[],{"EN":753,"VI":753},{"EN":753,"VI":755},[758],[762,763,764,765],{"id":726,"indexDatabase":1747,"url":741,"indexYears":26,"academicFieldIds":1752,"indexDatabaseRanking":26},{"id":728,"createTime":729,"updateTime":730,"relativeEntities":1748,"label":1749,"description":1750,"key":737,"publicationTags":1751,"standard":26},[],{"EN":733,"VI":733},{"VI":735,"EN":736},[739,740],[743,744],{"impactFactor":36,"impactFactorByYear":1754,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":115,"totalPublicationByYear":1755,"totalCitation":36,"totalCitationByYear":1756,"totalCitationPerPublication":36,"totalCitationPerPublicationByYear":1757,"hindexLast5Year":36,"hindex":36},{},{"2008":115},{},{},{"total":357,"publishYear":26,"statisticByYear":1759},{"2012":115,"2013":162,"2014":114,"2015":111,"2016":114,"2017":59,"2018":111,"2019":111,"2020":158,"2021":111,"2022":158,"2023":52,"2024":115},"2007-12-01",2007,[],{"id":1764,"createTime":1765,"updateTime":1766,"relativeEntities":1767,"slug":1768,"properties":1769,"entityType":793,"verifyStatus":25,"verifyTime":1766,"verifyNote":794,"syncStatus":28,"languages":1780,"translateLanguages":26,"viewCount":36,"primaryUrl":1781,"fullTextUrl":26,"authors":1782,"publicationType":832,"publisherRelationship":1801,"citationCount":1829,"citationInfo":1830,"publishDate":1832,"publishYear":1194,"citationAnalyzeStatus":1120,"lastCitationAnalyze":1833,"indexDatabases":26,"openAccess":26,"references":1834,"isForceReanalyzing":961},"2e8e78c4-a4a8-42f8-adce-24b053380f27","2024-04-13T05:16:34.382+00:00","2025-02-14T11:29:59.183+00:00",[],"Perceptrons-PP-and-the-polynomial-hierarchy",{"mag":1770,"keywords":1772,"openalex":1773,"abstract":1775,"title":1776,"doi":1778},{"VOID":1771},"2150157290",{},{"VOID":1774},"W2150157290",{},{"EN":1777},"Perceptrons, PP, and the polynomial hierarchy",{"VOID":1779},"10.1007\u002Fbf01263422",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002FBF01263422",[1783],{"id":1784,"sortIndex":36,"researcher":26,"roles":1785,"affiliations":1786,"properties":1796},"a381d3f3-3a53-4c50-9a53-faedd8f22d0c",[],[1787],{"id":26,"sortIndex":36,"affiliation":1788,"properties":26},{"id":1789,"createTime":1790,"updateTime":1790,"relativeEntities":1791,"slug":1792,"properties":1793,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"247df523-3aa7-471e-a7b3-46ba1ed8a086","2023-11-26T15:35:02.913+00:00",[],"Dept-of-Computer-Science-New-Haven-USA",{"title":1794},{"VI":1795},"Dept. of Computer Science, New Haven, USA",{"openalex":1797,"title":1799},{"VOID":1798},"A5078715930",{"EN":1800},"Richard Beigel",{"url":26,"publisher":1802,"properties":26},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1803,"slug":663,"properties":1804,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1807,"manageAffiliations":1808,"indexDatabases":1809,"url":26,"thumbnailPath":26,"statistic":1824,"gsStatistic":26,"type":175,"analyzePriority":26},[],{"issn":1805,"title":1806},{"VOID":666},{"VOID":668},[],[],[1810,1817],{"id":746,"indexDatabase":1811,"url":759,"indexYears":760,"academicFieldIds":1816,"indexDatabaseRanking":766},{"id":748,"createTime":749,"updateTime":750,"relativeEntities":1812,"label":1813,"description":1814,"key":756,"publicationTags":1815,"standard":26},[],{"EN":753,"VI":753},{"EN":753,"VI":755},[758],[762,763,764,765],{"id":726,"indexDatabase":1818,"url":741,"indexYears":26,"academicFieldIds":1823,"indexDatabaseRanking":26},{"id":728,"createTime":729,"updateTime":730,"relativeEntities":1819,"label":1820,"description":1821,"key":737,"publicationTags":1822,"standard":26},[],{"EN":733,"VI":733},{"VI":735,"EN":736},[739,740],[743,744],{"impactFactor":36,"impactFactorByYear":1825,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":115,"totalPublicationByYear":1826,"totalCitation":36,"totalCitationByYear":1827,"totalCitationPerPublication":36,"totalCitationPerPublicationByYear":1828,"hindexLast5Year":36,"hindex":36},{},{"2008":115},{},{},80,{"total":1829,"publishYear":26,"statisticByYear":1831},{"2012":59,"2013":162,"2015":162,"2016":111,"2017":115,"2018":111,"2019":115,"2021":158,"2022":115,"2023":115},"1994-12-01","2024-04-13T15:36:10.533+00:00",[1835,1838,1842,1846,1849,1853,1857,1860,1864,1868,1872,1876,1879,1882,1885,1888,1891,1894,1898,1902,1906,1910],{"id":26,"text":1836,"url":26,"identifiers":1837},"E. Allender, A note on the power of threshold circuits. InProceedings of the 30th Ann. Symp. Found. Comput. Sci., 1989, 580?584.",{"doi":881},{"id":26,"text":1839,"url":26,"identifiers":1840},"E. Allender and U. Hertrampf, Depth reduction for circuits of unbounded fanin.Inform. and Comput. 108 (1994). To appear.",{"doi":1841},"10.1006\u002Finco.1994.1057",{"id":26,"text":1843,"url":26,"identifiers":1844},"J. Aspnes, R. Beigel, M. Furst, and S. Rudich, The expressive power of voting polynomials. InProceedings of the 23rd Ann. ACM Symp. Theor. Comput., 1991, 402?409. A revised version is to appear inCombinatorica.",{"doi":1845},"10.1145\u002F103418.103461",{"id":26,"text":1847,"url":26,"identifiers":1848},"R. Beigel and J. Tarui, On ACC. This Journal.",{},{"id":26,"text":1850,"url":26,"identifiers":1851},"R. Beigel, L. A. Hemachandra, andG. Wechsung, Probabilistic polynomial time is closed under parity reductions.Inform. Process. Lett. 37(2) (1991a), 91?94.",{"doi":1852},"10.1016\u002F0020-0190(91)90140-D",{"id":26,"text":1854,"url":26,"identifiers":1855},"R. Beigel, N. Reingold, and D. Spielman, The perceptron strikes back. InProceedings of the 6th Ann. Conf. Structure in Complexity Theory, 1991b, 286?291.",{"doi":1856},"10.1109\u002FSCT.1991.160270",{"id":26,"text":1858,"url":26,"identifiers":1859},"R. Beigel, N. Reingold, and D. Spielman, PP is closed under intersection.J. Comput. System Sci. 48 (1994). To appear.",{},{"id":26,"text":1861,"url":26,"identifiers":1862},"S. R. Buss andL. E. Hay, On truth table reducibility to SAT.Inform. and Comput. 91(1) (1991), 86?102.",{"doi":1863},"10.1016\u002F0890-5401(91)90075-D",{"id":26,"text":1865,"url":26,"identifiers":1866},"E. W. Cheney,Approximation Theory. McGraw-Hill, 1966.",{"doi":1867},"10.2307\u002F2314671",{"id":26,"text":1869,"url":26,"identifiers":1870},"H. Ehlich andK. Zeller, Schwankung von polynomen zwischen gitterpunkten.Math. Z. 86 (1964), 41?44.",{"doi":1871},"10.1007\u002FBF01111276",{"id":26,"text":1873,"url":26,"identifiers":1874},"B. Fu, Separating PH from PP by relativization.Acta Math. Sinica 8(3) (1992), 329?336.",{"doi":1875},"10.1007\u002FBF02582920",{"id":26,"text":1877,"url":26,"identifiers":1878},"M. Furst, J. B. Saxe, andM. Sipser, Parity, circuits, and the polynomial-time hierarchy.Math. Systems Theory 17(1) (1984), 13?27.",{"doi":908},{"id":26,"text":1880,"url":26,"identifiers":1881},"T. Gundermann, N. Nasser, and G. Wechsung, A survey of counting classes. InProceedings of the 5th Ann. Conf. Structure in Complexity Theory. IEEE Computer Society Press, 1990, 140?153.",{},{"id":26,"text":1883,"url":26,"identifiers":1884},"L. Hemachandra andG. Wechsung, On the power of probabilistic polynomial time: $$P^{NP[log]} \\subseteq PP$$ . Technical Report CUCS-372-88, Columbia Dept. of Computer Science, New York, NY, 1988.",{},{"id":26,"text":1886,"url":26,"identifiers":1887},"G. G. Lorentz,Approximation of Functions. Holt, Rinehart and Winston, New York, 1966.",{},{"id":26,"text":1889,"url":26,"identifiers":1890},"M. L. Minsky andS. A. Papert,Perceptrons. MIT Press, Cambridge, MA, 1988. Expanded version of the original 1968 edition.",{},{"id":26,"text":1892,"url":26,"identifiers":1893},"G. Pólya andG. Szegö,Problems and Theorems in Analysis. Springer-Verlag, Berlin, 1972.",{},{"id":26,"text":1895,"url":26,"identifiers":1896},"T. J. Rivlin andE. W. Cheney, A comparison of uniform approximations on an interval and a finite subset thereof.SIAM Numer. Anal. 3(2) (1966), 311?320.",{"doi":1897},"10.1137\u002F0703024",{"id":26,"text":1899,"url":26,"identifiers":1900},"J. Tarui, Probabilistic polynomials, AC0 functions, and the polynomial-time hierarchy.Theoret. Comput. Sci. 113 (1993), 167?183.",{"doi":1901},"10.1016\u002F0304-3975(93)90214-E",{"id":26,"text":1903,"url":26,"identifiers":1904},"S. Toda, PP is as hard as the polynomial-time hierarchy.SIAM J. Comput. 20(5) (1991), 865?877.",{"doi":1905},"10.1137\u002F0220053",{"id":26,"text":1907,"url":26,"identifiers":1908},"S. Toda andM. Ogiwara, Counting classes are at least as hard as the polynomial-time hierarchy.SIAM J. Comput. 21(2) (1992), 316?328.",{"doi":1909},"10.1137\u002F0221023",{"id":26,"text":1911,"url":26,"identifiers":1912},"A. C.-C. Yao, On ACC and threshold circuits. InProceedings of the 31st Ann. Symp. Found. Comput. Sci., 1990, 619?627.",{"doi":1913},"10.1109\u002FFSCS.1990.89583",{"id":1915,"createTime":1916,"updateTime":1916,"relativeEntities":1917,"slug":1918,"properties":1919,"entityType":793,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":1930,"translateLanguages":26,"viewCount":36,"primaryUrl":1931,"fullTextUrl":26,"authors":1932,"publicationType":832,"publisherRelationship":1974,"citationCount":165,"citationInfo":2008,"publishDate":2010,"publishYear":2011,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":2012,"isForceReanalyzing":961},"6abd1249-8a28-42af-ba4b-3eed68154249","2024-04-21T10:57:29.672+00:00",[],"Approximation-Resistant-Predicates-from-Pairwise-Independence",{"mag":1920,"keywords":1922,"openalex":1923,"abstract":1925,"title":1926,"doi":1928},{"VOID":1921},"2179897858",{},{"VOID":1924},"W2179897858",{},{"EN":1927},"Approximation Resistant Predicates from Pairwise Independence",{"VOID":1929},"10.1007\u002Fs00037-009-0272-6",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs00037-009-0272-6",[1933,1954],{"id":1934,"sortIndex":115,"researcher":26,"roles":1935,"affiliations":1936,"properties":1947},"b60bf304-c6ce-45fe-9a78-89396c1600a2",[],[1937],{"id":1938,"sortIndex":36,"affiliation":1939,"properties":26},"a3fdb1f9-4500-43c1-9a37-2ab95d9f9d6f",{"id":1940,"createTime":1941,"updateTime":1941,"relativeEntities":1942,"slug":1943,"properties":1944,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"7ad3eb0e-4ed2-481c-918e-077fc8a2cb94","2024-04-21T10:57:29.699+00:00",[],"U-C-Berkeley-Berkeley-CA-94720-USA",{"title":1945},{"EN":1946},"U.C. Berkeley, Berkeley, CA, 94720, USA",{"openalex":1948,"orcid":1950,"title":1952},{"VOID":1949},"A5069069702",{"VOID":1951},"https:\u002F\u002Forcid.org\u002F0000-0001-7812-7886",{"EN":1953},"Elchanan Mossel",{"id":1955,"sortIndex":36,"researcher":26,"roles":1956,"affiliations":1957,"properties":1969},"6145a225-ad36-42da-80f1-20fca6e1cb91",[],[1958],{"id":1959,"sortIndex":36,"affiliation":1960,"properties":26},"16fc5e63-93ad-4411-ad92-4be3226c2545",{"id":1961,"createTime":1962,"updateTime":1963,"relativeEntities":1964,"slug":1965,"properties":1966,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"8ce5d054-fd25-4ad4-a0b1-01a21ab206fd","2024-01-11T00:11:59.901+00:00","2024-12-24T23:07:53.056+00:00",[],"KTH-Royal-Institute-of-Technology-Stockholm-Sweden",{"title":1967},{"VI":1968},"KTH Royal Institute of Technology, Stockholm, Sweden",{"openalex":1970,"title":1972},{"VOID":1971},"A5055776088",{"EN":1973},"Per Austrin",{"url":26,"publisher":1975,"properties":2002},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1976,"slug":663,"properties":1977,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1980,"manageAffiliations":1981,"indexDatabases":1982,"url":26,"thumbnailPath":26,"statistic":1997,"gsStatistic":26,"type":175,"analyzePriority":26},[],{"issn":1978,"title":1979},{"VOID":666},{"VOID":668},[],[],[1983,1990],{"id":746,"indexDatabase":1984,"url":759,"indexYears":760,"academicFieldIds":1989,"indexDatabaseRanking":766},{"id":748,"createTime":749,"updateTime":750,"relativeEntities":1985,"label":1986,"description":1987,"key":756,"publicationTags":1988,"standard":26},[],{"EN":753,"VI":753},{"EN":753,"VI":755},[758],[762,763,764,765],{"id":726,"indexDatabase":1991,"url":741,"indexYears":26,"academicFieldIds":1996,"indexDatabaseRanking":26},{"id":728,"createTime":729,"updateTime":730,"relativeEntities":1992,"label":1993,"description":1994,"key":737,"publicationTags":1995,"standard":26},[],{"EN":733,"VI":733},{"VI":735,"EN":736},[739,740],[743,744],{"impactFactor":36,"impactFactorByYear":1998,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":115,"totalPublicationByYear":1999,"totalCitation":36,"totalCitationByYear":2000,"totalCitationPerPublication":36,"totalCitationPerPublicationByYear":2001,"hindexLast5Year":36,"hindex":36},{},{"2008":115},{},{},{"volume":2003,"pages":2005,"issue":2007},{"VOID":2004},"18",{"VOID":2006},"249-271",{"VOID":867},{"total":165,"publishYear":26,"statisticByYear":2009},{"2012":116,"2013":52,"2014":158,"2015":103,"2016":114,"2017":162,"2018":114,"2019":115,"2020":115,"2021":162,"2022":59,"2024":115},"2009-06-01",2009,[],{"id":2014,"createTime":2015,"updateTime":2015,"relativeEntities":2016,"slug":2017,"properties":2018,"entityType":793,"verifyStatus":25,"verifyTime":2015,"verifyNote":794,"syncStatus":28,"languages":2029,"translateLanguages":26,"viewCount":36,"primaryUrl":2030,"fullTextUrl":26,"authors":2031,"publicationType":832,"publisherRelationship":2071,"citationCount":44,"citationInfo":2105,"publishDate":2107,"publishYear":2108,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":2109,"isForceReanalyzing":961},"ea01eda8-ebad-40c8-ad7c-07ba7413e047","2024-09-27T15:39:49.694+00:00",[],"On-the-hardness-of-computing-the-permanent-of-random-matrices",{"mag":2019,"keywords":2021,"openalex":2022,"abstract":2024,"title":2025,"doi":2027},{"VOID":2020},"1974964982",{},{"VOID":2023},"W1974964982",{},{"EN":2026},"On the hardness of computing the permanent of random matrices",{"VOID":2028},"10.1007\u002Fbf01262928",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002FBF01262928",[2032,2051],{"id":2033,"sortIndex":36,"researcher":26,"roles":2034,"affiliations":2035,"properties":2047},"1be1375d-b8b1-4d8e-8f97-33b8d70527fc",[],[2036],{"id":2037,"sortIndex":36,"affiliation":2038,"properties":26},"06dbefb8-4082-4d23-b88f-a7c2374a28d9",{"id":2039,"createTime":2040,"updateTime":2041,"relativeEntities":2042,"slug":2043,"properties":2044,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"34defdf1-ba26-4730-a818-df01e04acc37","2024-02-06T11:15:22.136+00:00","2024-12-30T19:20:11.638+00:00",[],"Department-of-Applied-Mathematics-The-Weizmann-Institute-Rehovot-Israel",{"title":2045},{"VI":2046},"Department of Applied Mathematics, The Weizmann Institute, Rehovot, Israel",{"openalex":2048,"orcid":2049,"title":2050},{"VOID":1338},{"VOID":1340},{"EN":1342},{"id":2052,"sortIndex":115,"researcher":26,"roles":2053,"affiliations":2054,"properties":2066},"1e73358d-4f0d-4fde-8370-b63a0e2f636f",[],[2055],{"id":2056,"sortIndex":36,"affiliation":2057,"properties":26},"0dd06813-7d38-4814-b0ae-bc85405fcb14",{"id":2058,"createTime":2059,"updateTime":2060,"relativeEntities":2061,"slug":2062,"properties":2063,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"bdf2ae16-760e-42c5-8a67-f3ef398f6e2a","2024-01-08T08:54:53.347+00:00","2024-09-27T15:39:49.721+00:00",[],"AT-T-Research-Murray-Hill",{"title":2064},{"VI":2065},"AT & T Research, Murray Hill",{"openalex":2067,"title":2069},{"VOID":2068},"A5022565251",{"EN":2070},"Carsten Lund",{"url":26,"publisher":2072,"properties":2099},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":2073,"slug":663,"properties":2074,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":2077,"manageAffiliations":2078,"indexDatabases":2079,"url":26,"thumbnailPath":26,"statistic":2094,"gsStatistic":26,"type":175,"analyzePriority":26},[],{"issn":2075,"title":2076},{"VOID":666},{"VOID":668},[],[],[2080,2087],{"id":746,"indexDatabase":2081,"url":759,"indexYears":760,"academicFieldIds":2086,"indexDatabaseRanking":766},{"id":748,"createTime":749,"updateTime":750,"relativeEntities":2082,"label":2083,"description":2084,"key":756,"publicationTags":2085,"standard":26},[],{"EN":753,"VI":753},{"EN":753,"VI":755},[758],[762,763,764,765],{"id":726,"indexDatabase":2088,"url":741,"indexYears":26,"academicFieldIds":2093,"indexDatabaseRanking":26},{"id":728,"createTime":729,"updateTime":730,"relativeEntities":2089,"label":2090,"description":2091,"key":737,"publicationTags":2092,"standard":26},[],{"EN":733,"VI":733},{"VI":735,"EN":736},[739,740],[743,744],{"impactFactor":36,"impactFactorByYear":2095,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":115,"totalPublicationByYear":2096,"totalCitation":36,"totalCitationByYear":2097,"totalCitationPerPublication":36,"totalCitationPerPublicationByYear":2098,"hindexLast5Year":36,"hindex":36},{},{"2008":115},{},{},{"volume":2100,"pages":2102,"issue":2104},{"VOID":2101},"6",{"VOID":2103},"101-132",{"VOID":867},{"total":44,"publishYear":26,"statisticByYear":2106},{"2012":115,"2013":114,"2015":115,"2016":114,"2018":115,"2019":59,"2020":115,"2022":115,"2024":115},"1996-06-01",1996,[2110,2114,2117,2121,2125,2128,2132,2136,2140,2144,2148,2151,2155,2159,2163,2166,2170,2174,2178,2182,2185,2188,2192,2196],{"id":26,"text":2111,"url":26,"identifiers":2112},"W. Alexi, B. Chor, O. Goldreich, and C. Schnorr, RSA\u002FRabin bits are 1\u002F2+1\u002Fpoly(logN) secure. InProceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, 1984, 449?457.",{"doi":2113},"10.1109\u002FSFCS.1984.715947",{"id":26,"text":2115,"url":26,"identifiers":2116},"A. Amir, R. Beigel, and W. I. Gasarch, Some connections between bounded query classes and non-uniform complexity. InProceedings of the 5th Annual Conference on Structure in Complexity Theory, 1990, 232?243.",{},{"id":26,"text":2118,"url":26,"identifiers":2119},"L. Babai andS. Moran, Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes.Journal of Computer and System Sciences 36(2) (1988), 254?276.",{"doi":2120},"10.1016\u002F0022-0000(88)90028-1",{"id":26,"text":2122,"url":26,"identifiers":2123},"D. Beaver and J. Feigenbaum, Hiding instances in multioracle queries. InProceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Sciencs, Lecture Notes in Computer Science415 (1990), 37?48.",{"doi":2124},"10.1007\u002F3-540-52282-4_30",{"id":26,"text":2126,"url":26,"identifiers":2127},"E. Berlekamp and L. Welch, Error correction of algebraic block codes. US Patent Number 4,633, 470, 1991.",{},{"id":26,"text":2129,"url":26,"identifiers":2130},"M. Blum andS. Micali, How to generate cryptographically strong sequences of pseudo-random bits.SIAM Journal on Computing 13(4) (1984), 850?864.",{"doi":2131},"10.1137\u002F0213053",{"id":26,"text":2133,"url":26,"identifiers":2134},"R. Boppana, J. Håstad, andS. Zachos, Does co-NP have short interactive proofs?Information Processing Letters 25(2) (1987), 127?132.",{"doi":2135},"10.1016\u002F0020-0190(87)90232-8",{"id":26,"text":2137,"url":26,"identifiers":2138},"J. Cai andL. Hemachandra, A Note on Enumerative Counting.Information Processing Letters 38(4) (1991), 215?219.",{"doi":2139},"10.1016\u002F0020-0190(91)90103-O",{"id":26,"text":2141,"url":26,"identifiers":2142},"P. Gemmell andM. Sudan, Highly resilient correctors for polynomials.Information Processing Letters 43, (1992), 169?174.",{"doi":2143},"10.1016\u002F0020-0190(92)90195-2",{"id":26,"text":2145,"url":26,"identifiers":2146},"P. Gemmell, R. Lipton, R. Rubinfeld, M. Sudan, and A. Wigderson, Selftesting\u002Fcorrecting for polynomials and for approximate functions. InProceedings of the Twenty-third Annual ACM Symposium on the Theory of Computing, 1991, 32?42.",{"doi":2147},"10.1145\u002F103418.103429",{"id":26,"text":2149,"url":26,"identifiers":2150},"S. Goldwasser and M. Sipser, Private coins versus public coins in interactive proof systems. InRandomness and Computation, ed.S. Micali, vol. 5 ofAdvances in Computing Research, JAI Press, 1989, 73?90.",{},{"id":26,"text":2152,"url":26,"identifiers":2153},"S. Goldwasser, S. Micali, andC. Rackoff, The knowledge complexity of interactive proof-systems.SIAM Journal on Computing 18(1) (1989), 186?208.",{"doi":2154},"10.1137\u002F0218012",{"id":26,"text":2156,"url":26,"identifiers":2157},"R. Lipton, New directions in testing. InDistributed computing and Cryptography, ed.J. Feigenbaum and M. Merritt, vol. 2 ofDIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, 1991, 191?202.",{"doi":2158},"10.1090\u002Fdimacs\u002F002\u002F13",{"id":26,"text":2160,"url":26,"identifiers":2161},"C. Lund, L. Fortnow, H. Karloff, andN. Nisan, Algebraic methods for interactive proof systems.Journal of the ACM 39(4) (1992), 859?868.",{"doi":2162},"10.1145\u002F146585.146605",{"id":26,"text":2164,"url":26,"identifiers":2165},"F. MacWilliams and N. Sloane,The Theory of Error-Correcting Codes. North-Holland, 1981.",{},{"id":26,"text":2167,"url":26,"identifiers":2168},"H. J. Ryser,Combinatorial Mathematics. Carus Mathematics Monograph14 (1963).",{"doi":2169},"10.5948\u002FUPO9781614440147",{"id":26,"text":2171,"url":26,"identifiers":2172},"A. Schrift and A. Shamir, The discrete log is very discreet. InProceedings of the Twenty-second Annual ACM Symposium on the Theory of Computing, 1990, 405?415.",{"doi":2173},"10.1145\u002F100216.100271",{"id":26,"text":2175,"url":26,"identifiers":2176},"J. T. Schwartz, Probabilistic algorithms for verification of polynomial identities.Journal of the ACM 27 (1980), 701?717.",{"doi":2177},"10.1145\u002F322217.322225",{"id":26,"text":2179,"url":26,"identifiers":2180},"L. Stockmeyer, The complexity of approximate counting. InProceedings of the Twnty-first Annual ACM Symposium on the Theory of Computing, 1983, 118?126.",{"doi":2181},"10.1145\u002F800061.808740",{"id":26,"text":2183,"url":26,"identifiers":2184},"S. Toda, On the computational power of PP and ?P. InProceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, 1989, 514?519.",{"doi":949},{"id":26,"text":2186,"url":26,"identifiers":2187},"S. Toda, 1990. Personal communication in Cai & Hemachandra (1991).",{},{"id":26,"text":2189,"url":26,"identifiers":2190},"L. Valiant, The complexity of computing the permanent.Theoretical Computer Science 8 (1979), 189?201.",{"doi":2191},"10.1016\u002F0304-3975(79)90044-6",{"id":26,"text":2193,"url":26,"identifiers":2194},"L. Valiant andV. Vazirani, NP is as easy as detecting unique solutions.Theoretical Computer Science 47(1) (1986), 85?93.",{"doi":2195},"10.1016\u002F0304-3975(86)90135-0",{"id":26,"text":2197,"url":26,"identifiers":2198},"V. Zanko,#P-completeness via many-one reductions.International Journal of Foundations of Computer Science (1991).",{"doi":2199},"10.1142\u002FS0129054191000066"]