Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 2002
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540440406, 9783540456872

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Algorithms for Computing Small NFAs

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 2002 ◽

10.1007/3-540-45687-2_27 ◽

2002 ◽

pp. 328-340 ◽

Cited By ~ 13

Author(s):

Lucian Iliea ◽

Sheng Yu

Download Full-text

Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 2002 ◽

10.1007/3-540-45687-2_23 ◽

2002 ◽

pp. 280-291 ◽

Cited By ~ 3

Author(s):

Andreas Goerdt ◽

Tomasz Jurdziński

Keyword(s):

Approximation Algorithms ◽

Random Structures

Download Full-text

On the Structure of the Simulation Order of Proof Systems

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 2002 ◽

10.1007/3-540-45687-2_48 ◽

2002 ◽

pp. 581-592 ◽

Cited By ~ 1

Author(s):

Jochen Messner

Keyword(s):

Proof Systems

Download Full-text

Derivation of Rational Expressions with Multiplicity

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 2002 ◽

10.1007/3-540-45687-2_39 ◽

2002 ◽

pp. 471-482 ◽

Cited By ~ 6

Author(s):

Sylvain Lombardy ◽

Jacques Sakarovitch

Keyword(s):

Rational Expressions

Download Full-text

Coloring k-Colorable Semirandom Graphs in Polynomial Expected Time via Semidefinite Programming

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 2002 ◽

10.1007/3-540-45687-2_16 ◽

2002 ◽

pp. 201-211 ◽

Cited By ~ 1

Author(s):

Amin Coja-Oghlan

Keyword(s):

Semidefinite Programming ◽

Expected Time

Download Full-text

On Infinite Terms Having a Decidable Monadic Theory

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 2002 ◽

10.1007/3-540-45687-2_13 ◽

2002 ◽

pp. 165-176 ◽

Cited By ~ 57

Author(s):

Didier Caucal

Keyword(s):

Monadic Theory

Download Full-text

Computing Partial Information out of Intractable One — The First Digit of 2n at Base 3 as an Example

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 2002 ◽

10.1007/3-540-45687-2_26 ◽

2002 ◽

pp. 319-327 ◽

Cited By ~ 1

Author(s):

Mika Hirvensalo ◽

Juhani Karhumäki

Keyword(s):

Partial Information

Download Full-text

Two-Way Finite State Transducers with Nested Pebbles

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 2002 ◽

10.1007/3-540-45687-2_19 ◽

2002 ◽

pp. 234-244 ◽

Cited By ~ 1

Author(s):

Joost Engelfriet ◽

Sebastian Maneth

Keyword(s):

Finite State Transducers ◽

Finite State

Download Full-text

Matroid Intersections, Polymatroid Inequalities, and Related Problems

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 2002 ◽

10.1007/3-540-45687-2_11 ◽

2002 ◽

pp. 143-154 ◽

Cited By ~ 2

Author(s):

Endre Boros ◽

Khaled Elbassioni ◽

Vladimir Gurvich ◽

Leonid Khachiyan

Download Full-text

Packing Edges in Random Regular Graphs

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 2002 ◽

10.1007/3-540-45687-2_9 ◽

2002 ◽

pp. 118-130 ◽

Cited By ~ 4

Author(s):

Mihalis Beis ◽

William Duckworth ◽

Michele Zito

Keyword(s):

Regular Graphs

Download Full-text

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 2002Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Algorithms for Computing Small NFAs

Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures

On the Structure of the Simulation Order of Proof Systems

Derivation of Rational Expressions with Multiplicity

Coloring k-Colorable Semirandom Graphs in Polynomial Expected Time via Semidefinite Programming

On Infinite Terms Having a Decidable Monadic Theory

Computing Partial Information out of Intractable One — The First Digit of 2n at Base 3 as an Example

Two-Way Finite State Transducers with Nested Pebbles

Matroid Intersections, Polymatroid Inequalities, and Related Problems

Packing Edges in Random Regular Graphs

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 2002
Latest Publications