Oracle machine

Known as: Oracle set, Oracle (computer science), Oracle tape 
In complexity theory and computability theory, an oracle machine is an abstract machine used to study decision problems. It can be visualized as a… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Greedy transition-based parsers are very fast but tend to suffer from error propagation. This problem is aggravated by the fact… (More)
  • figure 1
  • table 1
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We define (with machine-checked proofs in Coq) a modular operational semantics for Concurrent C minor—a language with shared… (More)
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Proactive learning is a generalization of active learning designed to relax unrealistic assumptions and thereby reach practical… (More)
  • table 2
  • table 1
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We describe a short signature scheme which is existentially unforgeable under a chosen message attack without using random… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Test designers widely believe that the overall effectiveness and cost of software testing depends largely on the type and number… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1995
Highly Cited
1995
We show that the class of all circuits is exactly learnable in randomized expected polynomial time using weak subset and weak… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Few would question that software testing is a necessary activity for assuring software quality, yet the typical testing process… (More)
  • figure 1
  • figure 2
  • table I
  • table 2
  • figure 3
Is this relevant?
Highly Cited
1992
Highly Cited
1992
The testing process is typically systematic in test data se- lection and test execution. For the most part, however, the… (More)
  • figure 1
  • table 1
  • table 3
  • table 2
  • table 5
Is this relevant?
Highly Cited
1987
Highly Cited
1987
In this paper, we examine various complexity issues relative to an oracle for a generic set in order to determine which are the… (More)
Is this relevant?
Highly Cited
1985
Highly Cited
1985
We present exponential lower bounds on the size of depth-k Boolean circuits for computing certain functions. These results imply… (More)
Is this relevant?