Fundamentals of Computation Theory - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540405436, 9783540450771

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45077-1_12 ◽

2003 ◽

pp. 118-131 ◽

Cited By ~ 1

Author(s):

Ivan Bjerre Damgård ◽

Gudmund Skovbjerg Frandsen

Keyword(s):

Error Estimates ◽

Worst Case ◽

Primality Test

Download Full-text

Languages Defined by Generalized Equality Sets

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45077-1_33 ◽

2003 ◽

pp. 355-363 ◽

Cited By ~ 3

Author(s):

Vesa Halava ◽

Tero Harju ◽

Hendrik Jan Hoogeboom ◽

Michel Latteux

Download Full-text

Baire’s Categories on Small Complexity Classes

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45077-1_31 ◽

2003 ◽

pp. 333-342 ◽

Cited By ~ 3

Author(s):

Philippe Moser

Keyword(s):

Complexity Classes

Download Full-text

Fast Perfect Phylogeny Haplotype Inference

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45077-1_18 ◽

2003 ◽

pp. 183-194 ◽

Cited By ~ 5

Author(s):

Peter Damaschke

Keyword(s):

Haplotype Inference ◽

Perfect Phylogeny

Download Full-text

Kleene’s Theorem for Weighted Tree-Automata

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45077-1_36 ◽

2003 ◽

pp. 387-399 ◽

Cited By ~ 4

Author(s):

Christian Pech

Keyword(s):

Tree Automata ◽

Weighted Tree ◽

Weighted Tree Automata

Download Full-text

Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45077-1_11 ◽

2003 ◽

pp. 109-117 ◽

Cited By ~ 3

Author(s):

Ivan Bjerre Damgård ◽

Gudmund Skovbjerg Frandsen

Keyword(s):

Efficient Algorithms

Download Full-text

One-Way Communication Complexity of Symmetric Boolean Functions

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45077-1_16 ◽

2003 ◽

pp. 158-170 ◽

Cited By ~ 1

Author(s):

Jan Arpe ◽

Andreas Jakoby ◽

Maciej Liśkiewicz

Keyword(s):

Boolean Functions ◽

Communication Complexity ◽

Symmetric Boolean Functions

Download Full-text

Membrane Computing

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45077-1_26 ◽

2003 ◽

pp. 284-295 ◽

Cited By ~ 9

Author(s):

Gheorghe Păun

Keyword(s):

Membrane Computing

Download Full-text

An Improved Approximation Algorithm for Computing Geometric Shortest Paths

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45077-1_23 ◽

2003 ◽

pp. 246-257 ◽

Cited By ~ 10

Author(s):

Lyudmil Aleksandrov ◽

Anil Maheshwari ◽

Jörg-Rüdiger Sack

Keyword(s):

Approximation Algorithm ◽

Shortest Paths

Download Full-text

An Improved Analysis of Goemans and Williamson’s LP-Relaxation for MAX SAT

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45077-1_2 ◽

2003 ◽

pp. 2-14 ◽

Cited By ~ 1

Author(s):

Takao Asano

Keyword(s):

Lp Relaxation ◽

Max Sat

Download Full-text

Fundamentals of Computation Theory - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates

Languages Defined by Generalized Equality Sets

Baire’s Categories on Small Complexity Classes

Fast Perfect Phylogeny Haplotype Inference

Kleene’s Theorem for Weighted Tree-Automata

Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers

One-Way Communication Complexity of Symmetric Boolean Functions

Membrane Computing

An Improved Approximation Algorithm for Computing Geometric Shortest Paths

An Improved Analysis of Goemans and Williamson’s LP-Relaxation for MAX SAT

Fundamentals of Computation Theory - Lecture Notes in Computer Science
Latest Publications