1.andom walks and forbidden minors II: A \poly ( d \eps − 1 ) -query tester for minor-closed properties of bounded degree graphs

作　　者：Akash Kumar ;C. Seshadhri ;Andrew Stolman

出　　处：Electronic Colloquium on Computational Complexity. 2019 ;2019:1-17.

出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung

文章 ID：243029149

文章详细全文下载
2.andom walks and forbidden minors II: A \poly ( d \eps − 1 ) -query tester for minor-closed properties of bounded degree graphs

作　　者：Akash Kumar ;C. Seshadhri ;Andrew Stolman

出　　处：Electronic Colloquium on Computational Complexity. 2019 ;2019:1-17.

出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung

文章 ID：243731556

文章详细全文下载
3.The impossibility of low-rank representations for triangle-rich complex networks

作　　者：C. Seshadhri ;Aneesh Sharma ;Andrew Stolman 等

出　　处：Proceedings of the National Academy of Sciences. 2020 ;117(11):5631-5637.doi:10.1073/pnas.1911030117

出版社：The National Academy of Sciences of the United States of America

文章 ID：244848679

文章详细全文下载
4.Finding forbidden minors in sublinear time: a O ( n 1 2+ o (1) ) -query one-sided tester for minor closed properties on bounded degree graphs

作　　者：Akash Kumar ;C. Seshadhri ;Andrew Stolman

出　　处：Electronic Colloquium on Computational Complexity. 2018 ;2018.

出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung

文章 ID：235153552

文章详细全文下载
5.Finding forbidden minors in sublinear time: a n 1 2+ o (1) -query one-sided tester for minor closed properties on bounded degree graphs

作　　者：Akash Kumar ;C. Seshadhri ;Andrew Stolman

出　　处：Electronic Colloquium on Computational Complexity. 2018 ;2018.

出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung

文章 ID：235153599

文章详细全文下载
6.Random walks and forbidden minors III: poly(d/?)-time partition oracles for minor-free graph classes

作　　者：Akash Kumar ;C.Seshadhri ;Andrew Stolman

出　　处：Electronic Colloquium on Computational Complexity. 2021 ;21.

出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung

文章 ID：1037095467

文章详细

	有本地全文	5篇
	有全文链接	1篇

	Andrew Stolman	6篇
	Akash Kumar	5篇
	C. Seshadhri	5篇
	Aneesh Sharma	1篇
	Ashish Goel	1篇

	计算技术、计算机技术	5篇
	自然科学总论	1篇

	德国	5篇
	美国	1篇

全文

出版年度

作者

来源期刊

学科主题

语种

国别/地区

检索条件:"( ( 高级检索(( ((AU:(("Andrew Stolman")))) )) ) )"

	Electronic Colloquium on Computational Complexity	5篇
	Proceedings of the National Academy of Sciences	1篇

	2021	1篇
	2020	1篇
	2019	2篇
	2018	2篇