SIAM Journal on Computing
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
- STOC
- 2014
A distributed network is modeled by a graph having <i>n</i> nodes (processors) and diameter <i>D</i>. We study the time… (More)
Is this relevant?
2013
2013
- ICALP
- 2013
We reduce non-deterministic time T ≥ 2n to a 3SAT instance φ of size |φ| = T · log T such that there is an explicit circuit C… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
- 48th Annual IEEE Symposium on Foundations of…
- 2007
We present a new approach to constructing pseudorandom generators that fool low-degree polynomials over finite fields, based on… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
- Algorithmica
- 2005
We describe an O(n 3/log n)-time algorithm for the all-pairs-shortest-paths problem for a real-weighted directed graph with n… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
- FOCS
- 2003
We show that if an NP-complete problem has a non-adaptive self-corrector with respect to a samplable distribution then coNP is… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
- FOCS
- 2003
We show new lower bounds and impossibility results for general (possibly non-black-box ) zero-knowledge proofs and arguments. Our… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
- IEEE Conference on Computational Complexity
- 2001
We put forward a new type of computationally-sound proof systems, called universal-arguments. Universal-arguments are related but… (More)
Is this relevant?
1998
1998
- 1998
We study the computational complexity of languages which have interactive proofs of logarithmic knowledge-complexity. We show… (More)
Is this relevant?
Highly Cited
1984
Highly Cited
1984
- SIAM J. Comput.
- 1984
Â
Is this relevant?
1974
1974
- SIGA
- 1974
The SIAM Journal on Computing is planning a Spring 1976 special issue on the topics of programming language modeling… (More)
Is this relevant?