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

TOTAL DOCUMENTS

41

(FIVE YEARS 0)

H-INDEX

5

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540745099, 9783540745105

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems

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

10.1007/978-3-540-74510-5_20 ◽

2007 ◽

pp. 182-193 ◽

Author(s):

Peter Jonsson ◽

Andrei Krokhin ◽

Fredrik Kuivinen

Keyword(s):

Polynomial Time ◽

Constraint Satisfaction ◽

Constraint Satisfaction Problems ◽

Approximation Schemes ◽

Hard Constraint ◽

Time Approximation ◽

Polynomial Time Approximation

Download Full-text

Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth

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

10.1007/978-3-540-74510-5_19 ◽

2007 ◽

pp. 168-181 ◽

Author(s):

Artur Jeż ◽

Alexander Okhotin

Keyword(s):

Conjunctive Grammars

Download Full-text

Equivalence Problems for Circuits over Sets of Natural Numbers

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

10.1007/978-3-540-74510-5_15 ◽

2007 ◽

pp. 127-138 ◽

Author(s):

Christian Glaßer ◽

Katrin Herr ◽

Christian Reitwießner ◽

Stephen Travers ◽

Matthias Waldherr

Keyword(s):

Natural Numbers ◽

Equivalence Problems

Download Full-text

Proved-Patterns-Based Development for Structured Programs

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

10.1007/978-3-540-74510-5_13 ◽

2007 ◽

pp. 104-114 ◽

Author(s):

Dominique Cansell ◽

Dominique Méry

Download Full-text

The Limits of Quantum Computers

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

10.1007/978-3-540-74510-5_2 ◽

2007 ◽

pp. 4-4

Author(s):

Scott Aaronson

Keyword(s):

Quantum Computers

Download Full-text

Generic Complexity of Undecidable Problems

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

10.1007/978-3-540-74510-5_41 ◽

2007 ◽

pp. 407-417

Author(s):

Alexei Myasnikov

Keyword(s):

Generic Complexity

Download Full-text

Estimation of the Click Volume by Large Scale Regression Analysis

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

10.1007/978-3-540-74510-5_23 ◽

2007 ◽

pp. 216-226 ◽

Author(s):

Yury Lifshits ◽

Dirk Nowotka

Keyword(s):

Regression Analysis ◽

Download Full-text

Efficient Computation in Groups Via Compression

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

10.1007/978-3-540-74510-5_26 ◽

2007 ◽

pp. 249-258 ◽

Author(s):

Markus Lohrey ◽

Saul Schleimer

Keyword(s):

Efficient Computation

Download Full-text

A Padding Technique on Cellular Automata to Transfer Inclusions of Complexity Classes

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

10.1007/978-3-540-74510-5_34 ◽

2007 ◽

pp. 337-348 ◽

Author(s):

Victor Poupet

Keyword(s):

Cellular Automata ◽

Complexity Classes

Download Full-text

Constructing a Secret Binary Partition of a Digital Image Robust to a Loss of Synchronization

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

10.1007/978-3-540-74510-5_27 ◽

2007 ◽

pp. 259-268

Author(s):

Alexei Lysenko

Keyword(s):

Digital Image ◽

Binary Partition

Download Full-text