On the Structure of Bounded Queries to Arbitrary NP Sets

doi 10.1109/sct.1989.41832
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

IEEE Comput. Soc. Press

Related search

Functions Computable With Nonadaptive Queries to NP

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
1998English

NP-Creative Sets: A New Class of Creative Sets in NP

Mathematical Systems Theory
1996English

The Strict Topology on Bounded Sets

Pacific Journal of Mathematics
Mathematics
1970English

Scaling Random Walks on Arbitrary Sets

Mathematical Proceedings of the Cambridge Philosophical Society
Mathematics
1999English

On Bounded Sets in F-Spaces

Colloquium Mathematicum
Mathematics
1962English

On Bounded Arithmetic Augmented by the Ability to Count Certain Sets of Primes

Journal of Symbolic Logic
PhilosophyLogic
2009English

On the Reduction of Pairs of Bounded Closed Convex Sets

Studia Mathematica
Mathematics
2008English

On the Number of Connected Sets in Bounded Degree Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1992English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy