JCSS 1998 | Sciweavers

5

JCSS
1998

51views more JCSS 1998»

Randomized Query Processing in Robot Path Planning

13 years 4 months ago

d Abstract) LYDIA E. KAVRAKI JEAN-CLAUDE LATOMBE RAJEEV MOTWANI ¡ PRABHAKAR RAGHAVAN ¢ The subject of this paper is the analysis of a randomized preprocessing scheme that ...

Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motw...

claim paper

Read More »

10

click to vote

JCSS
1998

65views more JCSS 1998»

Good Degree Bounds on Nullstellensatz Refutations of the Induction Principle

13 years 4 months ago

Download math.ucsd.edu

This paper gives nearly optimal, logarithmic upper and lower bounds on the minimum degree of Nullstellensatz refutations (i.e., polynomials) of the propositional induction princip...

Samuel R. Buss, Toniann Pitassi

claim paper

Read More »

2

click to vote

JCSS
1998

45views more JCSS 1998»

The Relative Complexity of NP Search Problems

13 years 4 months ago

Download www.cs.washington.edu

Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell...

claim paper

Read More »

5

click to vote

JCSS
1998

53views more JCSS 1998»

Approximating Hyper-Rectangles: Learning and Pseudorandom Sets

13 years 4 months ago

Download www.phillong.info

Peter Auer, Philip M. Long, Aravind Srinivasan

claim paper

Read More »

13

click to vote

JCSS
1998

74views more JCSS 1998»

Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem

13 years 4 months ago

Download www.cs.rutgers.edu

We show that all sets that are complete for NP under non-uniform AC0 reductions are isomorphic under non-uniform AC0-computable isomorphisms. Furthermore, these sets remain NP-com...

Manindra Agrawal, Eric Allender, Steven Rudich

claim paper

Read More »

5

click to vote

JCSS
1998

39views more JCSS 1998»

DNA Models and Algorithms for NP-Complete Problems

13 years 4 months ago