You have Guest access.
Log In
Jin-Yi Cai, S. Barry Cooper and Angsheng Li
Front matter
1-20
On-Line Algorithms, Real Time, the Virtue of Laziness, and the Power of Clairvoyance
21-45
Similarity of Objects and the Meaning of Words
46-60
Totally < ωω Computably Enumerable and m-topped Degrees
61-67
Mitosis in Computational Complexity
68-78
Models of Intuitionistic Set Theories over Partial Combinatory Algebras
79-88
Width Versus Size in Resolution Proofs
89
Recent Progress in Quantum Computational Complexity
90-98
On Several Scheduling Problems with Rejection or Discretely Compressible Processing Times
99-107
LS-SVM Based on Chaotic Particle Swarm Optimization with Simulated Annealing
108-117
A Bounded Item Bin Packing Problem over Discrete Distribution
118-127
Scheduling Jobs on a Flexible Batching Machine: Model, Complexity and Algorithms
128-137
Faster Algorithms for Sorting by Transpositions and Sorting by Block-Interchanges
138-147
An ACO-Based Approach for Task Assignment and Scheduling of Multiprocessor Control Systems
148-158
Adversary Immune Size Approximation of Single-Hop Radio Networks
159-170
On Load-Balanced Semi-matchings for Weighted Bipartite Graphs
171-180
Analyzing Chain Programs over Difference Constraints
181-191
Linear-Time 2-Approximation Algorithm for the Watchman Route Problem
192-197
Further Properties of Cayley Digraphs and Their Applications to Interconnection Networks
198-205
Real Time Critical Edge of the Shortest Path in Transportation Networks
206-216
Finding Min-Sum Disjoint Shortest Paths from a Single Source to All Pairs of Destinations
217-230
A New Approximation Algorithm for the k-Facility Location Problem
231-235
Alternative Measures of Computational Complexity with Applications to Agnostic Learning
236-247
Disjoint NP-Pairs from Propositional Proof Systems
248-261
Valiant’s Holant Theorem and Matchgate Tensors
262-273
Variable Minimal Unsatisfiability
274-282
A New Lower Bound of Critical Function for (k,s)-SAT
283-294
Cluster Computing and the Power of Edge Recognition
295-307
Quadratic Lower Bounds on Matrix Rigidity
308-317
Non-reducible Descriptions for Conditional Kolmogorov Complexity
318-326
Generalized Counters and Reversal Complexity
327-338
Multisource Algorithmic Information Theory
339-344
Block Sensitivity of Weakly Symmetric Functions
345-355
Optimization Problems in the Polynomial-Time Hierarchy
356-364
#3-Regular Bipartite Planar Vertex Cover is #P-Complete
365-374
Group Theory Based Synthesis of Binary Reversible Circuits
375-386
On Some Complexity Issues of NC Analytic Functions
387-398
Learning Juntas in the Presence of Noise
399-407
Grey Reinforcement Learning for Incomplete Information Processing
408-420
On the Foundations of Universal Sequence Prediction
421-431
Some Recent Results in U-Shaped Learning
432-441
Learning Overcomplete Representations with a Generalized Gaussian Prior
442-451
On PAC Learning Algorithms for Rich Boolean Function Classes
452-463
On-Line Regression Competitive with Reproducing Kernel Hilbert Spaces
464-473
Inductive Inference and Language Learning
474-481
Time Series Predictions Using Multi-scale Support Vector Regressions
482-493
Identification and Comparison of Motifs in Brain-Specific and Muscle-Specific Alternative Splicing
494-504
On Probe Permutation Graphs
505-514
Automatic Classification of Protein Structures Based on Convex Hull Representation by Integrated Neural Network
515-527
Protein Structure Comparison Based on a Measure of Information Discrepancy
528-537
Succinct Text Indexes on Large Alphabet
538-546
Identity-Based Threshold Proxy Signature Scheme with Known Signers
547-554
Secure Computations in a Minimal Model Using Multiple-Valued ESOP Expressions
555-565
Towards Practical Computable Functions on Context-Free Languages
566-575
The Extended Probabilistic Powerdomain Monad over Stably Compact Spaces
576-587
Analysis of Properties of Petri Synthesis Net
588-600
A Tree Construction of the Preferable Answer Sets for Prioritized Basic Disjunctive Logic Programs
601-610
Object-Oriented Specification Composition and Refinement Via Category Theoretic Computations
611-620
Improved SAT Based Bounded Model Checking
621-630
Encodings and Arithmetic Operations in Membrane Computing
631-643
The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation
644-653
Forecasting Black Holes in Abstract Geometrical Computation is Highly Unpredictable
654-674
The Trade-Off Theorem and Fragments of Gödel’s T
675-683
On Non-binary Quantum BCH Codes
684-693
Maximal Models of Assertion Graph in GSTE
694-703
Immunity Properties and the n-C.E. Hierarchy
704-706
On Rogers Semilattices
707-720
Invertible Classes
721-730
Universal Cupping Degrees
731-736
On the Quotient Structure of Computably Enumerable Degrees Modulo the Noncuppable Ideal
737-745
Enumeration Degrees of the Bounded Total Sets
746-755
A Generic Set That Does Not Bound a Minimal Pair
756-764
Lowness for Weakly 1-generic and Kurtz-Random
765-771
On Differences Among Elementary Theories of Finite Levels of Ershov Hierarchies
772-782
On Mass Problems of Presentability
783-792
Beyond the First Main Theorem – When Is the Solution of a Linear Cauchy Problem Computable?
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info