Catalogo Articoli (Spogli Riviste)

HELP
ATTENZIONE: attualmente gli articoli Current Contents (fonte ISI) a partire dall'anno 2002 sono consultabili sulla Risorsa On-Line

Le informazioni sugli articoli di fonte ISI sono coperte da copyright

La ricerca find articoli where soggetti phrase all words 'polynomial hierarchy' sort by level,fasc_key/DESCEND, pagina_ini_num/ASCEND ha restituito 42 riferimenti
Selezionare un intervallo

Per ulteriori informazioni selezionare i riferimenti di interesse.

    1. Koiran, P
      Transfer theorems via sign conditions

      INFORMATION PROCESSING LETTERS
    2. Fenner, S; Homer, S; Pruim, R; Schaefer, M
      Hyper-polynomial hierarchies and the polynomial jump

      THEORETICAL COMPUTER SCIENCE
    3. Reith, S; Wagner, KW
      On boolean lowness and boolean highness

      THEORETICAL COMPUTER SCIENCE
    4. Micciancio, D
      The hardness of the closest vector problem with preprocessing

      IEEE TRANSACTIONS ON INFORMATION THEORY
    5. Kiwi, M; Lund, C; Spielman, D; Russell, A; Sundaram, R
      Alternation in interaction

      COMPUTATIONAL COMPLEXITY
    6. Green, F
      A complex-number Fourier technique for lower bounds on the Mod-m degree

      COMPUTATIONAL COMPLEXITY
    7. Goldsmith, J; Ogihara, M; Rothe, J
      Tally NP sets and easy census functions

      INFORMATION AND COMPUTATION
    8. Pollett, C
      Multifunction algebras and the provability of PH down arrow

      ANNALS OF PURE AND APPLIED LOGIC
    9. Green, F
      Exponential sums and circuits with a single threshold gate and mod-gates

      THEORY OF COMPUTING SYSTEMS
    10. Fenner, S; Green, F; Homer, S; Pruim, R
      Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy

      PROCEEDINGS OF THE ROYAL SOCIETY OF LONDON SERIES A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES
    11. Fenner, S; Selman, AL; Green, F; Thierauf, T; Homer, S; Vollmer, H
      Complements of multivalued functions

      CHICAGO JOURNAL OF THEORETICAL COMPUTER SCIENCE
    12. Rothe, J
      Immunity and simplicity for exact counting and other counting classes

      RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS
    13. HEMASPAANDRA E; HEMASPAANDRA LA; HEMPEL H
      A DOWNWARD COLLAPSE WITHIN THE POLYNOMIAL HIERARCHY

      SIAM journal on computing (Print)
    14. KOBLER J; WATANABE O
      NEW COLLAPSE CONSEQUENCES OF NP HAVING SMALL CIRCUITS

      SIAM journal on computing (Print)
    15. Fortnow, L
      Relativized worlds with an infinite hierarchy

      INFORMATION PROCESSING LETTERS
    16. Book, RV; Vollmer, H; Wagner, KW
      Probabilistic type-2 operators and "almost"-classes

      COMPUTATIONAL COMPLEXITY
    17. NAIK AV; ROGERS JD; ROYER JS; SELMAN AL
      A HIERARCHY BASED ON OUTPUT MULTIPLICITY

      Theoretical computer science
    18. GUPTA S
      ISOLATING AN ODD NUMBER OF ELEMENTS AND APPLICATIONS IN COMPLEXITY THEORY

      theory of computing systems
    19. BLOCH S
      ON PARALLEL HIERARCHIES AND R-K(I)

      Annals of pure and applied Logic
    20. HAN YN; HEMASPAANDRA LA; THIERAUF T
      THRESHOLD COMPUTATION AND CRYPTOGRAPHIC SECURITY

      SIAM journal on computing
    21. HEMASPAANDRA LA; OGIHARA M
      UNIVERSALLY SERIALIZABLE COMPUTATION

      Journal of computer and system sciences
    22. PETRANK E; ROTH RM
      IS CODE EQUIVALENCE EASY TO DECIDE

      IEEE transactions on information theory
    23. FENNER S; FORTNOW L; LI LD
      GAP-DEFINABILITY AS A CLOSURE PROPERTY

      Information and computation
    24. JENNER B; MCKENZIE P; THERIEN D
      LOGSPACE AND LOGTIME LEAF LANGUAGES

      Information and computation
    25. CHANG R; KADIN J
      THE BOOLEAN HIERARCHY AND THE POLYNOMIAL HIERARCHY - A CLOSER CONNECTION

      SIAM journal on computing
    26. HEMASPAANDRA LA; ZIMAND M
      STRONG SELF-REDUCIBILITY PRECLUDES STRONG IMMUNITY

      Mathematical systems theory
    27. CAI JY; GREEN F; THIERAUF T
      ON THE CORRELATION OF SYMMETRICAL FUNCTIONS

      Mathematical systems theory
    28. OGIHARA M; THIERAUF T; TODA S; WATANABE O
      ON CLOSURE-PROPERTIES OF NUMBER-P IN THE CONTEXT OF PF-CIRCLE-NUMBER-P

      Journal of computer and system sciences
    29. HELLERSTEIN L; PILLAIPAKKAMNATT K; RAGHAVAN V; WILKINS D
      HOW MANY QUERIES ARE NEEDED TO LEARN

      Journal of the ACM
    30. BORCHERT B
      ON THE ACCEPTANCE POWER OF REGULAR LANGUAGES

      Theoretical computer science
    31. LONG TJ; SHEU MJ
      A REFINEMENT OF THE LOW AND HIGH HIERARCHIES

      Mathematical systems theory
    32. REGAN KW; ROYER JS
      ON CLOSURE-PROPERTIES OF BOUNDED 2-SIDED ERROR COMPLEXITY CLASSES

      Mathematical systems theory
    33. BEIGEL R; REINGOLD N; SPIELMAN D
      PP IS CLOSED UNDER INTERSECTION

      Journal of computer and system sciences
    34. RAMACHANDRAN J
      MODULE CLASSES AND LOGARITHMIC ADVICE

      Information processing letters
    35. ALLENDER E; HERTRAMPF U
      DEPTH REDUCTION FOR CIRCUITS OF UNBOUNDED FAN-IN

      Information and computation
    36. SHEU MJ; LONG TJ
      THE EXTENDED LOW HIERARCHY IS AN INFINITE HIERARCHY

      SIAM journal on computing
    37. BOOK RV
      RELATIVIZATIONS OF THE P=QUESTIONABLE NP AND OTHER PROBLEMS - DEVELOPMENTS IN STRUCTURAL COMPLEXITY THEORY

      SIAM review
    38. BOOK RV; LUTZ JH; WAGNER KW
      AN OBSERVATION ON PROBABILITY VERSUS RANDOMNESS WITH APPLICATIONS TO COMPLEXITY CLASSES

      Mathematical systems theory
    39. FENNER SA; FORTNOW LJ; KURTZ SA
      GAP-DEFINABLE COUNTING CLASSES

      Journal of computer and system sciences
    40. FEIGENBAUM J; FORTNOW L
      RANDOM-SELF-REDUCIBILITY OF COMPLETE-SETS

      SIAM journal on computing
    41. GUPTA S
      ON BOUNDED-PROBABILITY OPERATORS AND C=P

      Information processing letters
    42. TODA S; OGIWARA M
      COUNTING CLASSES ARE AT LEAST AS HARD AS THE POLYNOMIAL-TIME HIERARCHY

      SIAM journal on computing


ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 25/02/20 alle ore 10:00:34