Multitasking Capacity: Hardness Results and Improved Constructions
暂无分享,去创建一个
Noga Alon | Thomas L. Griffiths | Jonathan D. Cohen | Pasin Manurangsi | Daniel Reichman | Igor Shinkar | Tal Wagner | Alexander Y. Ku
[1] Michael Stiebitz,et al. On a special case of Hadwiger's conjecture , 2003, Discuss. Math. Graph Theory.
[2] Jonathan D. Cohen,et al. Controlled vs. Automatic Processing: A Graph-Theoretic Approach to the Analysis of Serial vs. Parallel Processing in Neural Network Architectures , 2016, CogSci.
[3] G. Szekeres,et al. A combinatorial problem in geometry , 2009 .
[4] Adam S. Jobson,et al. Connected matchings in chordal bipartite graphs , 2014, Discret. Optim..
[5] J. Townsend,et al. A theory of interactive parallel processing: new capacity measures and predictions for a response time inequality series. , 2004, Psychological review.
[6] James L. McClelland,et al. On the control of automatic processes: a parallel distributed processing account of the Stroop effect. , 1990, Psychological review.
[7] U. Feige,et al. Generalized Girth Problems in Graphs and Hypergraphs , 2013 .
[8] Nathan Linial,et al. On the uniform-traffic capacity of single-hop interconnections employing shared directional multichannels , 1993, IEEE Trans. Inf. Theory.
[9] Noga Alon,et al. Nearly complete graphs decomposable into large induced matchings and their applications , 2013 .
[10] J D Cohen,et al. Multitasking versus multiplexing: Toward a normative account of limitations in the simultaneous execution of control-demanding behaviors , 2014, Cognitive, affective & behavioral neuroscience.
[11] Walter Schneider,et al. Controlled and automatic human information processing: II. Perceptual learning, automatic attending and a general theory. , 1977 .
[12] Geoffrey E. Hinton,et al. A general framework for parallel distributed processing , 1986 .
[13] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[14] Imrich Chlamtac,et al. On Broadcasting in Radio Networks - Problem Analysis and Protocol Design , 1985, IEEE Transactions on Communications.
[15] Ken-ichi Kawarabayashi,et al. Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture , 2005, J. Comb. Theory, Ser. B.
[16] Benny Sudakov,et al. The Extremal Function for Cycles of Length l mod k , 2016, Electron. J. Comb..
[17] Jacques Verstraëte,et al. On Arithmetic Progressions of Cycle Lengths in Graphs , 2000, Combinatorics, Probability and Computing.
[18] Philipp Slusallek,et al. Introduction to real-time ray tracing , 2005, SIGGRAPH Courses.
[19] Zoltán Füredi,et al. Connected matchings and Hadwiger's conjecture , 2005, Combinatorics, Probability and Computing.
[20] Ravi B. Boppana,et al. Approximating maximum independent sets by excluding subgraphs , 1990, BIT.
[21] Kathie Cameron. Connected Matchings , 2001, Combinatorial Optimization.
[22] Noga Alon,et al. A graph-theoretic approach to multitasking , 2016, NIPS.
[23] Siu On Chan,et al. Approximation resistance from pairwise independent subgroups , 2013, STOC '13.
[24] Petr A. Golovach,et al. Hadwiger Number of Graphs with Small Chordality , 2015, SIAM J. Discret. Math..
[25] David Zuckerman,et al. Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .
[26] Pasin Manurangsi,et al. Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph , 2016, STOC.
[27] Geoffrey E. Hinton. 20 – CONNECTIONIST LEARNING PROCEDURES1 , 1990 .
[28] Subhash Khot,et al. Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.