Computer Science – Theory and Applications - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642207112, 9783642207129

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees

Computer Science – Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-20712-9_20 ◽

2011 ◽

pp. 261-274 ◽

Cited By ~ 4

Author(s):

Petr A. Golovach ◽

Daniël Paulusma ◽

Jian Song

Download Full-text

Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity

Computer Science – Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-20712-9_2 ◽

2011 ◽

pp. 15-28 ◽

Cited By ~ 9

Author(s):

Benjamin Doerr ◽

Carola Winzen

Keyword(s):

Complexity Theory ◽

Black Box ◽

Randomized Search Heuristics ◽

Search Heuristics ◽

Randomized Search

Download Full-text

Shared-Memory Systems and Charts

Computer Science – Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-20712-9_25 ◽

2011 ◽

pp. 317-330

Author(s):

Rémi Morin

Keyword(s):

Shared Memory ◽

Memory Systems

Download Full-text

Compressed Membership in Automata with Compressed Labels

Computer Science – Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-20712-9_21 ◽

2011 ◽

pp. 275-288 ◽

Cited By ~ 5

Author(s):

Markus Lohrey ◽

Christian Mathissen

Download Full-text

Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas

Computer Science – Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-20712-9_13 ◽

2011 ◽

pp. 162-180

Author(s):

László Babai

Keyword(s):

Complexity Theory ◽

Finite Groups ◽

Las Vegas ◽

Saint Petersburg

Download Full-text

Kolmogorov Complexity as a Language

Computer Science – Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-20712-9_9 ◽

2011 ◽

pp. 105-119

Author(s):

Alexander Shen

Keyword(s):

Kolmogorov Complexity

Download Full-text

The Complexity of Inversion of Explicit Goldreich’s Function by DPLL Algorithms

Computer Science – Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-20712-9_11 ◽

2011 ◽

pp. 134-147 ◽

Cited By ~ 2

Author(s):

Dmitry Itsykson ◽

Dmitry Sokolov

Download Full-text

Learning Read-Constant Polynomials of Constant Degree Modulo Composites

Computer Science – Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-20712-9_3 ◽

2011 ◽

pp. 29-42 ◽

Cited By ~ 1

Author(s):

Arkadev Chattopadhyay ◽

Ricard Gavaldà ◽

Kristoffer Arnsfelt Hansen ◽

Denis Thérien

Keyword(s):

Constant Degree

Download Full-text

A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row

Computer Science – Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-20712-9_29 ◽

2011 ◽

pp. 373-384 ◽

Cited By ~ 3

Author(s):

Guillaume Blin ◽

Romeo Rizzi ◽

Stéphane Vialette

Keyword(s):

Polynomial Time ◽

Polynomial Time Algorithm ◽

Time Algorithm

Download Full-text

On the Arithmetic Complexity of Euler Function

Computer Science – Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-20712-9_4 ◽

2011 ◽

pp. 43-49 ◽

Cited By ~ 1

Author(s):

Manindra Agrawal

Keyword(s):

Euler Function ◽

Arithmetic Complexity

Download Full-text

Computer Science – Theory and Applications - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees

Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity

Shared-Memory Systems and Charts

Compressed Membership in Automata with Compressed Labels

Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas

Kolmogorov Complexity as a Language

The Complexity of Inversion of Explicit Goldreich’s Function by DPLL Algorithms

Learning Read-Constant Polynomials of Constant Degree Modulo Composites

A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row

On the Arithmetic Complexity of Euler Function

Computer Science – Theory and Applications - Lecture Notes in Computer Science
Latest Publications