Facet browsing currently unavailable
Page 4 of 3758 results
Sort by: relevance publication year
Special Section on the Fifty-Fourth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013) JOURNAL ARTICLE published January 2016 in SIAM Journal on Computing |
Special Section on the Forty-Ninth Annual ACM Symposium on the Theory of Computing (STOC 2017) JOURNAL ARTICLE published April 2022 in SIAM Journal on Computing |
An Associative Block Design ABD(8,5) JOURNAL ARTICLE published January 1999 in SIAM Journal on Computing |
The Complexity of Weighted Boolean #CSP JOURNAL ARTICLE published January 2009 in SIAM Journal on Computing |
The Sign-Rank of AC$^0$ JOURNAL ARTICLE published January 2010 in SIAM Journal on Computing |
Optimal (Euclidean) Metric Compression JOURNAL ARTICLE published June 2022 in SIAM Journal on Computing Research funded by National Science Foundation (IIS-144747,DMS-2022448) |
An $o(n^3 )$-Time Maximum-Flow Algorithm JOURNAL ARTICLE published December 1996 in SIAM Journal on Computing |
A Generalized Asymptotic Upper Bound on Fast Polynomial Evaluation and Interpolation JOURNAL ARTICLE published December 1976 in SIAM Journal on Computing |
Efficient Motion Planning for an L-Shaped Object JOURNAL ARTICLE published February 1992 in SIAM Journal on Computing |
On the Additive Complexity of Matrix Multiplication JOURNAL ARTICLE published June 1976 in SIAM Journal on Computing |
The Approximability of Constraint Satisfaction Problems JOURNAL ARTICLE published January 2001 in SIAM Journal on Computing |
Markov Paging JOURNAL ARTICLE published January 2000 in SIAM Journal on Computing |
Compact Labeling Scheme for Ancestor Queries JOURNAL ARTICLE published January 2006 in SIAM Journal on Computing |
Vertical Ray Shooting and Computing Depth Orders for Fat Objects JOURNAL ARTICLE published January 2008 in SIAM Journal on Computing |
The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection JOURNAL ARTICLE published April 1996 in SIAM Journal on Computing |
A PTAS for the Steiner Forest Problem in Doubling Metrics JOURNAL ARTICLE published January 2018 in SIAM Journal on Computing Research funded by Research Grants Council, University Grants Committee (17217716) |
Communication Complexity of Discrete Fair Division JOURNAL ARTICLE published January 2020 in SIAM Journal on Computing Research funded by National Science Foundation (CCF-1524062) |
Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions JOURNAL ARTICLE published August 1992 in SIAM Journal on Computing |
Approximating Boolean Functions with Depth-2 Circuits JOURNAL ARTICLE published January 2015 in SIAM Journal on Computing |
On the Power of Logic Resynthesis JOURNAL ARTICLE published January 2000 in SIAM Journal on Computing |