Si mostrano 100 riferimenti a partire da 1 |

Per ulteriori informazioni selezionare i riferimenti di interesse.

- Le, HO; Le, VB

The NP-completeness of (1,r)-subcolorability of cubic graphs*INFORMATION PROCESSING LETTERS*

- Cesati, M

Perfect code is W[1]-complete*INFORMATION PROCESSING LETTERS*

- Branke, J; Leppert, S; Middendorf, M; Eades, P

Width-restricted layering of acyclic digraphs with consideration of dummy nodes*INFORMATION PROCESSING LETTERS*

- Koiran, P

Transfer theorems via sign conditions*INFORMATION PROCESSING LETTERS*

- Petersen, H

Bounds for the Element Distinctness Problem on one-tape Turing machines*INFORMATION PROCESSING LETTERS*

- Bachman, A; Janiak, A; Kovalyov, MY

Minimizing the total weighted completion time of deteriorating jobs*INFORMATION PROCESSING LETTERS*

- Lozin, VV

On maximum induced matchings in bipartite graphs*INFORMATION PROCESSING LETTERS*

- Shi, YY

Entropy lower bounds for quantum decision tree complexity*INFORMATION PROCESSING LETTERS*

- Prasad, B

Product, process and methodology systematization to handle structural and computational complexity in product realization*SYSTEMS RESEARCH AND BEHAVIORAL SCIENCE*

- Glass, CA; Potts, CN; Strusevich, VA

Scheduling batches with sequential job processing for two-machine flow andopen shops*INFORMS JOURNAL ON COMPUTING*

- 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*

- Reichel, J; Menegaz, G; Nadenau, MJ; Kunt, M

Integer wavelet transform for embedded lossy to lossless image compression*IEEE TRANSACTIONS ON IMAGE PROCESSING*

- 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*

- 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*

- Yamada, Y; Hara, S

Global optimization for robust control synthesis based on the Matrix Product Eigenvalue Problem*INTERNATIONAL JOURNAL OF ROBUST AND NONLINEAR CONTROL*

- Papadimitriou, S; Mavroudi, S; Vladutu, L; Bezerianos, A

Ischemia detection with a self-organizing map supplemented by supervised learning*IEEE TRANSACTIONS ON NEURAL NETWORKS*

- 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*

- 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*

- Vidyasagar, M

Randomized algorithms for robust controller synthesis using statistical learning theory: A tutorial overview*EUROPEAN JOURNAL OF CONTROL*

- Torasso, P

Multiple representations and multi-modal reasoning in medical diagnostic systems*ARTIFICIAL INTELLIGENCE IN MEDICINE*

- Webb, GI; Pazzani, MJ; Billsus, D

Machine learning for user modeling*USER MODELING AND USER-ADAPTED INTERACTION*

- 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*

- 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*

- Cai, X; Sha, D; Wong, CK

Time-varying universal maximum flow problems*MATHEMATICAL AND COMPUTER MODELLING*

- Brys, K; Lonc, Z

Monochromatic partitions of complete uniform hypergraphs*SIAM JOURNAL ON DISCRETE MATHEMATICS*

- Hass, J; Lagarias, JC

The number of Reidemeister moves needed for unknotting*JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY*

- Hromkovic, J; Schnitger, G

On the power of Las Vegas for one-way communication complexity, OBDDs, andfinite automata*INFORMATION AND COMPUTATION*

- Pighizzini, G

How hard is computing the edit distance?*INFORMATION AND COMPUTATION*

- Giusti, M; Lecerf, G; Salvy, B

A grobner free alternative for polynomial system solving*JOURNAL OF COMPLEXITY*

- Castro, D; Pardo, LM; Hagele, K; Morais, JE

Kronecker's and Newton's approaches to solving: A first comparison*JOURNAL OF COMPLEXITY*

- Machta, J; Li, XN

Parallel dynamics and computational complexity of the Bak-Sneppen model*PHYSICA A*

- Lin, BMT; Cheng, TCE

Batch scheduling in the no-wait two-machine flowshop to minimize the makespan*COMPUTERS & OPERATIONS RESEARCH*

- Mertens, S

A physicist's approach to number partitioning*THEORETICAL COMPUTER SCIENCE*

- Reith, S; Wagner, KW

On boolean lowness and boolean highness*THEORETICAL COMPUTER SCIENCE*

- Maass, W

On the relevance of time in neural computation and learning*THEORETICAL COMPUTER SCIENCE*

- Caporaso, S; Zito, M; Galesi, N

A predicative and decidable characterization of the polynomial classes of languages*THEORETICAL COMPUTER SCIENCE*

- Franciosa, PG; Frigioni, D; Giaccio, R

Semi-dynamic breadth-first search in digraphs*THEORETICAL COMPUTER SCIENCE*

- 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*

- Devillers, O; Guigue, P

The shuffling buffer*INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS*

- Barequet, G; Har-Peled, S

Polygon containment and translational min-Hausdorff-distance between segment sets are 3SUM-hard*INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS*

- Beling, PA

Exact algorithms for linear programming over algebraic extensions*ALGORITHMICA*

- Flammini, M; Nardelli, E; Proietti, G

ATM layouts with bounded hop count and congestion*DISTRIBUTED COMPUTING*

- Elomaa, T; Rousu, J

On the computational complexity of optimal multisplitting*FUNDAMENTA INFORMATICAE*

- Hajek, P; Tulipani, S

Complexity of fuzzy probability logics*FUNDAMENTA INFORMATICAE*

- Ruthing, O

Code motion in the presence of critical edges without bidirectional data flow analysis*SCIENCE OF COMPUTER PROGRAMMING*

- Zukerman, M; Jia, L; Neame, T; Woeginger, GJ

A polynomially solvable special case of the unbounded knapsack problem*OPERATIONS RESEARCH LETTERS*

- Furman, KC; Sahinidis, NV

Computational complexity of heat exchanger network synthesis*COMPUTERS & CHEMICAL ENGINEERING*

- Mulmuley, KD; Sohoni, M

Geometric complexity theory I: An approach to the P vs. NP and related problems*SIAM JOURNAL ON COMPUTING*

- Garg, A; Tamassia, R

On the computational complexity of upward and rectilinear planarity testing*SIAM JOURNAL ON COMPUTING*

- Jakubowicz, C; Nash, L

Functional categories and syntactic operations in (ab)normal language acquisition*BRAIN AND LANGUAGE*

- Boettcher, S; Percus, AG

Optimization with extremal dynamics*PHYSICAL REVIEW LETTERS*

- Clifford, JJ; Posner, ME

Parallel machine scheduling with high multiplicity*MATHEMATICAL PROGRAMMING*

- Tourlakis, I

Time-space tradeoffs for SAT on nonuniform machines*JOURNAL OF COMPUTER AND SYSTEM SCIENCES*

- Lautemann, C; McKenzie, P; Schwentick, T; Vollmer, H

The descriptive complexity approach to LOGCFL*JOURNAL OF COMPUTER AND SYSTEM SCIENCES*

- Faigle, U; Kern, W; Kuipers, J

On the computation of the nucleolus of a cooperative game*INTERNATIONAL JOURNAL OF GAME THEORY*

- Green, F; Pruim, R

Relativized separation of EQP from P-NP*INFORMATION PROCESSING LETTERS*

- Wan, GH; Yen, BPC; Li, CL

Single machine scheduling to minimize total compression plus weighted flowcost is NP-hard*INFORMATION PROCESSING LETTERS*

- Wu, J; Sheng, L

An efficient sorting algorithm for a sequence of kings in a tournament*INFORMATION PROCESSING LETTERS*

- Shmulevich, I; Korshunov, AD; Astola, J

Almost all monotone Boolean functions are polynomially learnable using membership queries*INFORMATION PROCESSING LETTERS*

- Santhanam, R

Lower bounds on the complexity of recognizing SAT by Turing machines*INFORMATION PROCESSING LETTERS*

- Knill, E; Laflamme, R

Quantum computing and quadratically signed weight enumerators*INFORMATION PROCESSING LETTERS*

- Loding, C

Efficient minimization of deterministic weak omega-automata*INFORMATION PROCESSING LETTERS*

- Van den Bussche, J

Rewriting queries using views over monadic database schemas*INFORMATION PROCESSING LETTERS*

- Schnorr, CP

Small generic hardcore subsets for the discrete logarithm: Short secret DL-keys*INFORMATION PROCESSING LETTERS*

- Woeginger, GJ

The reconstruction of polyominoes from their orthogonal projections*INFORMATION PROCESSING LETTERS*

- Micciancio, D

The hardness of the closest vector problem with preprocessing*IEEE TRANSACTIONS ON INFORMATION THEORY*

- Bianchini, M; Fanelli, S; Gori, M

Optimal algorithms for well-conditioned nonlinear systems of equations*IEEE TRANSACTIONS ON COMPUTERS*

- Vidyasagar, M

Randomized algorithms for robust controller synthesis using statistical learning theory*AUTOMATICA*

- Ibaraki, T; Kogan, A; Makino, K

On functional dependencies in q-Horn theories*ARTIFICIAL INTELLIGENCE*

- Woeginger, GJ

A note on the depth function of combinatorial optimization problems*DISCRETE APPLIED MATHEMATICS*

- Faria, L; de Figueiredo, CMH; Mendonca, CFX

SPLITTING NUMBER is NP-complete*DISCRETE APPLIED MATHEMATICS*

- Boettcher, S

Extremal optimization: Heuristics via coevolutionary avalanches*COMPUTING IN SCIENCE & ENGINEERING*

- Schild, K

On the relationship between BDI logics and standard logics of concurrency*AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS*

- Brazil, M; Thomas, DA; Weng, JF

On the complexity of the Steiner problem*JOURNAL OF COMBINATORIAL OPTIMIZATION*

- Dell'Amico, M; Maffioli, F

Combining linear and non-linear objectives in spanning tree problems*JOURNAL OF COMBINATORIAL OPTIMIZATION*

- Wright, AH; Thompson, RK; Zhang, J

The computational complexity of N-K fitness functions*IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION*

- Koehler, J; Hoffmann, J

On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm*JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH*

- Attallah, S

The wavelet transform-domain LMS algorithm: A more practical approach*IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-ANALOG AND DIGITAL SIGNAL PROCESSING*

- Best, MJ; Chakravarti, N; Ubhaya, VA

Minimizing separable convex functions subject to simple chain constraints*SIAM JOURNAL ON OPTIMIZATION*

- Buccafurri, F; Leone, N; Rullo, P

Enhancing disjunctive datalog by constraints*IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING*

- Chittaro, L; Montanari, A

Temporal representation and reasoning in artificial intelligence: Issues and approaches*ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE*

- Grigoriev, DY; Lakshman, YN

Algorithms for computing sparse shifts for multivariate polynomials*APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING*

- Toda, S

Traversing graphs in small space*IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS*

- Miwa, H; Ito, H

NP-completeness of reallocation problems with restricted block volume*IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES*

- 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*

- 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*

- 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*

- Cheng, TCE; Lin, BMT; Toker, A

Makespan minimization in the two-machine flowshop batch scheduling problem*NAVAL RESEARCH LOGISTICS*

- Chakraborty, S; Choudhury, PP

A statistical analysis of an algorithm's complexity*APPLIED MATHEMATICS LETTERS*

- Pan, VY

Approximating complex polynomial zeros: Modified Weyl's quadtree construction and improved Newton's iteration*JOURNAL OF COMPLEXITY*

- Major, RL

A complexity model and a polynomial algorithm for decision-tree-based feature construction*COMPUTATIONAL INTELLIGENCE*

- 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*

- Mundhenk, M

The complexity of optimal small policies*MATHEMATICS OF OPERATIONS RESEARCH*

- Sarkar, P

A brief history of cellular automats*ACM COMPUTING SURVEYS*

- Dunne, PE; Gibbons, A; Zito, M

Complexity-theoretic models of phase transitions in search problems*THEORETICAL COMPUTER SCIENCE*

- Jonsson, P

Boolean constraint satisfaction: complexity results for optimization problems with arbitrary weights*THEORETICAL COMPUTER SCIENCE*

- Hemaspaandra, LA; Rothe, J

A second step towards complexity-theoretic analogs of Rice's Theorem*THEORETICAL COMPUTER SCIENCE*

- Hemaspaandra, LA; Rothe, J

Characterizing the existence of one-way permutations*THEORETICAL COMPUTER SCIENCE*

- van Melkebeek, D

The zero-one law holds for RPP*THEORETICAL COMPUTER SCIENCE*

- 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