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 'computational complexity' sort by level,fasc_key/DESCEND, pagina_ini_num/ASCEND ha restituito 751 riferimenti
Si mostrano 100 riferimenti a partire da 1
Selezionare un intervallo

Per ulteriori informazioni selezionare i riferimenti di interesse.

    1. Le, HO; Le, VB
      The NP-completeness of (1,r)-subcolorability of cubic graphs

      INFORMATION PROCESSING LETTERS
    2. Cesati, M
      Perfect code is W[1]-complete

      INFORMATION PROCESSING LETTERS
    3. Branke, J; Leppert, S; Middendorf, M; Eades, P
      Width-restricted layering of acyclic digraphs with consideration of dummy nodes

      INFORMATION PROCESSING LETTERS
    4. Koiran, P
      Transfer theorems via sign conditions

      INFORMATION PROCESSING LETTERS
    5. Petersen, H
      Bounds for the Element Distinctness Problem on one-tape Turing machines

      INFORMATION PROCESSING LETTERS
    6. Bachman, A; Janiak, A; Kovalyov, MY
      Minimizing the total weighted completion time of deteriorating jobs

      INFORMATION PROCESSING LETTERS
    7. Lozin, VV
      On maximum induced matchings in bipartite graphs

      INFORMATION PROCESSING LETTERS
    8. Shi, YY
      Entropy lower bounds for quantum decision tree complexity

      INFORMATION PROCESSING LETTERS
    9. Prasad, B
      Product, process and methodology systematization to handle structural and computational complexity in product realization

      SYSTEMS RESEARCH AND BEHAVIORAL SCIENCE
    10. Glass, CA; Potts, CN; Strusevich, VA
      Scheduling batches with sequential job processing for two-machine flow andopen shops

      INFORMS JOURNAL ON COMPUTING
    11. Shmulevich, I; Gabbouj, M; Astola, J
      Complexity of the consistency problem for certain post classes

      IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS
    12. Reichel, J; Menegaz, G; Nadenau, MJ; Kunt, M
      Integer wavelet transform for embedded lossy to lossless image compression

      IEEE TRANSACTIONS ON IMAGE PROCESSING
    13. Attallah, S; Liaw, SW
      Analysis of DCTLMS algorithm with a selective coefficient updating

      IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-ANALOG AND DIGITAL SIGNAL PROCESSING
    14. Zhao, DB; Chan, YK; Gao, W
      Low-complexity and low-memory entropy coder for image compression

      IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY
    15. Yamada, Y; Hara, S
      Global optimization for robust control synthesis based on the Matrix Product Eigenvalue Problem

      INTERNATIONAL JOURNAL OF ROBUST AND NONLINEAR CONTROL
    16. Papadimitriou, S; Mavroudi, S; Vladutu, L; Bezerianos, A
      Ischemia detection with a self-organizing map supplemented by supervised learning

      IEEE TRANSACTIONS ON NEURAL NETWORKS
    17. Kobara, K; Imai, H
      The capacity of narrow-band subliminal channels in the case of successive carrier transmission

      ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE
    18. Bollig, B
      Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication

      RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS
    19. Vidyasagar, M
      Randomized algorithms for robust controller synthesis using statistical learning theory: A tutorial overview

      EUROPEAN JOURNAL OF CONTROL
    20. Torasso, P
      Multiple representations and multi-modal reasoning in medical diagnostic systems

      ARTIFICIAL INTELLIGENCE IN MEDICINE
    21. Webb, GI; Pazzani, MJ; Billsus, D
      Machine learning for user modeling

      USER MODELING AND USER-ADAPTED INTERACTION
    22. Ohta, A; Tsuji, K
      Polynomial time decidability of monotone liveness of time bounded AC/DC nets

      IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
    23. Yamamichi, M; Mambo, M; Shizuya, H
      On the complexity of constructing an elliptic curve of a given order

      IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
    24. Cai, X; Sha, D; Wong, CK
      Time-varying universal maximum flow problems

      MATHEMATICAL AND COMPUTER MODELLING
    25. Brys, K; Lonc, Z
      Monochromatic partitions of complete uniform hypergraphs

      SIAM JOURNAL ON DISCRETE MATHEMATICS
    26. Hass, J; Lagarias, JC
      The number of Reidemeister moves needed for unknotting

      JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY
    27. Hromkovic, J; Schnitger, G
      On the power of Las Vegas for one-way communication complexity, OBDDs, andfinite automata

      INFORMATION AND COMPUTATION
    28. Pighizzini, G
      How hard is computing the edit distance?

      INFORMATION AND COMPUTATION
    29. Giusti, M; Lecerf, G; Salvy, B
      A grobner free alternative for polynomial system solving

      JOURNAL OF COMPLEXITY
    30. Castro, D; Pardo, LM; Hagele, K; Morais, JE
      Kronecker's and Newton's approaches to solving: A first comparison

      JOURNAL OF COMPLEXITY
    31. Machta, J; Li, XN
      Parallel dynamics and computational complexity of the Bak-Sneppen model

      PHYSICA A
    32. Lin, BMT; Cheng, TCE
      Batch scheduling in the no-wait two-machine flowshop to minimize the makespan

      COMPUTERS & OPERATIONS RESEARCH
    33. Mertens, S
      A physicist's approach to number partitioning

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

      THEORETICAL COMPUTER SCIENCE
    35. Maass, W
      On the relevance of time in neural computation and learning

      THEORETICAL COMPUTER SCIENCE
    36. Caporaso, S; Zito, M; Galesi, N
      A predicative and decidable characterization of the polynomial classes of languages

      THEORETICAL COMPUTER SCIENCE
    37. Franciosa, PG; Frigioni, D; Giaccio, R
      Semi-dynamic breadth-first search in digraphs

      THEORETICAL COMPUTER SCIENCE
    38. Fotakis, DA; Nikoletseas, SE; Papadopoulou, VG; Spirakis, PG
      Hardness results and efficient approximations for frequency assignment problems: Radio labelling and radio coloring

      COMPUTING AND INFORMATICS
    39. Devillers, O; Guigue, P
      The shuffling buffer

      INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS
    40. Barequet, G; Har-Peled, S
      Polygon containment and translational min-Hausdorff-distance between segment sets are 3SUM-hard

      INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS
    41. Beling, PA
      Exact algorithms for linear programming over algebraic extensions

      ALGORITHMICA
    42. Flammini, M; Nardelli, E; Proietti, G
      ATM layouts with bounded hop count and congestion

      DISTRIBUTED COMPUTING
    43. Elomaa, T; Rousu, J
      On the computational complexity of optimal multisplitting

      FUNDAMENTA INFORMATICAE
    44. Hajek, P; Tulipani, S
      Complexity of fuzzy probability logics

      FUNDAMENTA INFORMATICAE
    45. Ruthing, O
      Code motion in the presence of critical edges without bidirectional data flow analysis

      SCIENCE OF COMPUTER PROGRAMMING
    46. Zukerman, M; Jia, L; Neame, T; Woeginger, GJ
      A polynomially solvable special case of the unbounded knapsack problem

      OPERATIONS RESEARCH LETTERS
    47. Furman, KC; Sahinidis, NV
      Computational complexity of heat exchanger network synthesis

      COMPUTERS & CHEMICAL ENGINEERING
    48. Mulmuley, KD; Sohoni, M
      Geometric complexity theory I: An approach to the P vs. NP and related problems

      SIAM JOURNAL ON COMPUTING
    49. Garg, A; Tamassia, R
      On the computational complexity of upward and rectilinear planarity testing

      SIAM JOURNAL ON COMPUTING
    50. Jakubowicz, C; Nash, L
      Functional categories and syntactic operations in (ab)normal language acquisition

      BRAIN AND LANGUAGE
    51. Boettcher, S; Percus, AG
      Optimization with extremal dynamics

      PHYSICAL REVIEW LETTERS
    52. Clifford, JJ; Posner, ME
      Parallel machine scheduling with high multiplicity

      MATHEMATICAL PROGRAMMING
    53. Tourlakis, I
      Time-space tradeoffs for SAT on nonuniform machines

      JOURNAL OF COMPUTER AND SYSTEM SCIENCES
    54. Lautemann, C; McKenzie, P; Schwentick, T; Vollmer, H
      The descriptive complexity approach to LOGCFL

      JOURNAL OF COMPUTER AND SYSTEM SCIENCES
    55. Faigle, U; Kern, W; Kuipers, J
      On the computation of the nucleolus of a cooperative game

      INTERNATIONAL JOURNAL OF GAME THEORY
    56. Green, F; Pruim, R
      Relativized separation of EQP from P-NP

      INFORMATION PROCESSING LETTERS
    57. Wan, GH; Yen, BPC; Li, CL
      Single machine scheduling to minimize total compression plus weighted flowcost is NP-hard

      INFORMATION PROCESSING LETTERS
    58. Wu, J; Sheng, L
      An efficient sorting algorithm for a sequence of kings in a tournament

      INFORMATION PROCESSING LETTERS
    59. Shmulevich, I; Korshunov, AD; Astola, J
      Almost all monotone Boolean functions are polynomially learnable using membership queries

      INFORMATION PROCESSING LETTERS
    60. Santhanam, R
      Lower bounds on the complexity of recognizing SAT by Turing machines

      INFORMATION PROCESSING LETTERS
    61. Knill, E; Laflamme, R
      Quantum computing and quadratically signed weight enumerators

      INFORMATION PROCESSING LETTERS
    62. Loding, C
      Efficient minimization of deterministic weak omega-automata

      INFORMATION PROCESSING LETTERS
    63. Van den Bussche, J
      Rewriting queries using views over monadic database schemas

      INFORMATION PROCESSING LETTERS
    64. Schnorr, CP
      Small generic hardcore subsets for the discrete logarithm: Short secret DL-keys

      INFORMATION PROCESSING LETTERS
    65. Woeginger, GJ
      The reconstruction of polyominoes from their orthogonal projections

      INFORMATION PROCESSING LETTERS
    66. Micciancio, D
      The hardness of the closest vector problem with preprocessing

      IEEE TRANSACTIONS ON INFORMATION THEORY
    67. Bianchini, M; Fanelli, S; Gori, M
      Optimal algorithms for well-conditioned nonlinear systems of equations

      IEEE TRANSACTIONS ON COMPUTERS
    68. Vidyasagar, M
      Randomized algorithms for robust controller synthesis using statistical learning theory

      AUTOMATICA
    69. Ibaraki, T; Kogan, A; Makino, K
      On functional dependencies in q-Horn theories

      ARTIFICIAL INTELLIGENCE
    70. Woeginger, GJ
      A note on the depth function of combinatorial optimization problems

      DISCRETE APPLIED MATHEMATICS
    71. Faria, L; de Figueiredo, CMH; Mendonca, CFX
      SPLITTING NUMBER is NP-complete

      DISCRETE APPLIED MATHEMATICS
    72. Boettcher, S
      Extremal optimization: Heuristics via coevolutionary avalanches

      COMPUTING IN SCIENCE & ENGINEERING
    73. Schild, K
      On the relationship between BDI logics and standard logics of concurrency

      AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS
    74. Brazil, M; Thomas, DA; Weng, JF
      On the complexity of the Steiner problem

      JOURNAL OF COMBINATORIAL OPTIMIZATION
    75. Dell'Amico, M; Maffioli, F
      Combining linear and non-linear objectives in spanning tree problems

      JOURNAL OF COMBINATORIAL OPTIMIZATION
    76. Wright, AH; Thompson, RK; Zhang, J
      The computational complexity of N-K fitness functions

      IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
    77. Koehler, J; Hoffmann, J
      On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm

      JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH
    78. Attallah, S
      The wavelet transform-domain LMS algorithm: A more practical approach

      IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-ANALOG AND DIGITAL SIGNAL PROCESSING
    79. Best, MJ; Chakravarti, N; Ubhaya, VA
      Minimizing separable convex functions subject to simple chain constraints

      SIAM JOURNAL ON OPTIMIZATION
    80. Buccafurri, F; Leone, N; Rullo, P
      Enhancing disjunctive datalog by constraints

      IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
    81. Chittaro, L; Montanari, A
      Temporal representation and reasoning in artificial intelligence: Issues and approaches

      ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE
    82. Grigoriev, DY; Lakshman, YN
      Algorithms for computing sparse shifts for multivariate polynomials

      APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING
    83. Toda, S
      Traversing graphs in small space

      IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS
    84. Miwa, H; Ito, H
      NP-completeness of reallocation problems with restricted block volume

      IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
    85. Aoki, S; Ito, H; Uehara, H; Yokoyama, M; Horinouchi, T
      NP-hardness of rotation type cell-mazes

      IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
    86. Kwon, YD; Ishihara, Y; Shimizu, S; Ito, M
      Computational complexity of finding highly co-occurrent itemsets in marketbasket databases

      IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
    87. Tang, YS; Fujiwara, T; Kasami, T
      The optimal sectionalized trellises for the generalized version of Viterbialgorithm of linear block codes and its application to Reed-Muller codes

      IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
    88. Cheng, TCE; Lin, BMT; Toker, A
      Makespan minimization in the two-machine flowshop batch scheduling problem

      NAVAL RESEARCH LOGISTICS
    89. Chakraborty, S; Choudhury, PP
      A statistical analysis of an algorithm's complexity

      APPLIED MATHEMATICS LETTERS
    90. Pan, VY
      Approximating complex polynomial zeros: Modified Weyl's quadtree construction and improved Newton's iteration

      JOURNAL OF COMPLEXITY
    91. Major, RL
      A complexity model and a polynomial algorithm for decision-tree-based feature construction

      COMPUTATIONAL INTELLIGENCE
    92. Yau, V
      An empirical comparison of methodologies for obtaining results with specific accuracy and for run-length control in quantitative simulation

      TRANSACTIONS OF THE SOCIETY FOR COMPUTER SIMULATION INTERNATIONAL
    93. Mundhenk, M
      The complexity of optimal small policies

      MATHEMATICS OF OPERATIONS RESEARCH
    94. Sarkar, P
      A brief history of cellular automats

      ACM COMPUTING SURVEYS
    95. Dunne, PE; Gibbons, A; Zito, M
      Complexity-theoretic models of phase transitions in search problems

      THEORETICAL COMPUTER SCIENCE
    96. Jonsson, P
      Boolean constraint satisfaction: complexity results for optimization problems with arbitrary weights

      THEORETICAL COMPUTER SCIENCE
    97. Hemaspaandra, LA; Rothe, J
      A second step towards complexity-theoretic analogs of Rice's Theorem

      THEORETICAL COMPUTER SCIENCE
    98. Hemaspaandra, LA; Rothe, J
      Characterizing the existence of one-way permutations

      THEORETICAL COMPUTER SCIENCE
    99. van Melkebeek, D
      The zero-one law holds for RPP

      THEORETICAL COMPUTER SCIENCE
    100. Arai, NH
      Tractability of Cut-free Gentzen-type propositional calculus with permutation inference II

      THEORETICAL COMPUTER SCIENCE


ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 29/02/20 alle ore 01:19:30