Facet browsing currently unavailable
Page 10 of 3758 results
Sort by: relevance publication year
Realization with Feedback Encoding. II: Applications to Distinguishing Sequences JOURNAL ARTICLE published March 1975 in SIAM Journal on Computing |
Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates JOURNAL ARTICLE published January 2007 in SIAM Journal on Computing |
On Approximation Algorithms for # P JOURNAL ARTICLE published November 1985 in SIAM Journal on Computing |
Trevisan's Extractor in the Presence of Quantum Side Information JOURNAL ARTICLE published January 2012 in SIAM Journal on Computing |
Strict Polynomial-Time in Simulation and Extraction JOURNAL ARTICLE published January 2004 in SIAM Journal on Computing |
Determining Consensus Numbers JOURNAL ARTICLE published January 2000 in SIAM Journal on Computing |
Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security JOURNAL ARTICLE published January 2016 in SIAM Journal on Computing |
Backward Consistency and Sense of Direction in Advanced Distributed Systems JOURNAL ARTICLE published January 2003 in SIAM Journal on Computing |
Nondeterministic Computations in Sublogarithmic Space and Space Constructibility JOURNAL ARTICLE published June 1991 in SIAM Journal on Computing |
On Fixed-Points of Multivalued Functions on Complete Lattices and Their Application to Generalized Logic Programs JOURNAL ARTICLE published January 2009 in SIAM Journal on Computing |
A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem JOURNAL ARTICLE published May 1980 in SIAM Journal on Computing |
On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata JOURNAL ARTICLE published August 1985 in SIAM Journal on Computing |
On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation JOURNAL ARTICLE published January 2015 in SIAM Journal on Computing |
On the Power of Statistical Zero Knowledge JOURNAL ARTICLE published January 2020 in SIAM Journal on Computing Research funded by National Basic Research Program of China (2011CBA00300,2011CBA00301) | National Natural Science Foundation of China (61361136003) | National Science Foundation (1122374,1249349,CNS-1413920) |
Zero-Knowledge Proof Systems for QMA JOURNAL ARTICLE published January 2020 in SIAM Journal on Computing |
RSA and Rabin Functions: Certain Parts are as Hard as the Whole JOURNAL ARTICLE published April 1988 in SIAM Journal on Computing |
Privately Releasing Conjunctions and the Statistical Query Barrier JOURNAL ARTICLE published January 2013 in SIAM Journal on Computing |
Answering $n^2+o(1)$ Counting Queries with Differential Privacy is Hard JOURNAL ARTICLE published January 2016 in SIAM Journal on Computing |
A New Lower Bound for the Set-Partitioning Problem JOURNAL ARTICLE published August 1988 in SIAM Journal on Computing |
A general Sequential Time-Space Tradeoff for Finding Unique Elements JOURNAL ARTICLE published April 1991 in SIAM Journal on Computing |