The MathNet Korea
Information Center for Mathematical Science

### 논문검색

Information Center for Mathematical Science

SIAM Journal on Computing
( Vol.24 NO.2 / 1995 )
 A New Approach to Formal Language Theory by Kolmogorov Complexity Pages 398-410 Sparse Polynomial Interpolation in Nonstandard Bases Pages 387-397 Private Computations over the Integers Pages 376-386 Ordered and Unordered Tree Inclusion Pages 340-356 D$^{over}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems Pages 318-339 A General Approximation Technique for Constrained Forest Problems Pages 296-317 The Complexity and Distribution of Hard Problems Pages 279-295 Permuting in Place Pages 266-278 Algorithms for Enumerating all Spanning Trees of Undirected and Weighted Graphs Pages 247-265 On Computing Algebraic Functions Using Logarithms and Exponentials Pages 242-246 A Heuristic Scheduling of Independent Tasks with Bottleneck Resource Constraints Pages 235-241 An $\mathcal {NC}$ Algorithm for Evaluating Monotone Planar Circuits Pages 369-375 Sparse Approximate Solutions to Linear Systems Pages 227-234 A Randomized Maximum-Flow Algorithm Pages 203-226 Randomized Interpolation and Approximation of Sparse Polynomials Pages 357-368