Lecture Notes in Computer Science - Theory and Applications of Models of Computation
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540340218, 9783540340225

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Optimization Problems in the Polynomial-Time Hierarchy

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/11750321_33 ◽

2006 ◽

pp. 345-355

Author(s):

Christopher Umans

Keyword(s):

Polynomial Time ◽

Optimization Problems ◽

Polynomial Time Hierarchy

Download Full-text

A Generic Set That Does Not Bound a Minimal Pair

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/11750321_71 ◽

2006 ◽

pp. 746-755

Author(s):

Mariya Ivanova Soskova

Keyword(s):

Minimal Pair ◽

Generic Set

Download Full-text

The Trade-Off Theorem and Fragments of Gödel’s T

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/11750321_62 ◽

2006 ◽

pp. 654-674 ◽

Cited By ~ 5

Author(s):

Lars Kristiansen ◽

Paul J. Voda

Keyword(s):

Trade Off ◽

Gödel’S T

Download Full-text

Improved SAT Based Bounded Model Checking

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/11750321_58 ◽

2006 ◽

pp. 611-620 ◽

Cited By ~ 1

Author(s):

Conghua Zhou ◽

Decheng Ding

Keyword(s):

Model Checking ◽

Bounded Model Checking

Download Full-text

Identity-Based Threshold Proxy Signature Scheme with Known Signers

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/11750321_51 ◽

2006 ◽

pp. 538-546 ◽

Cited By ~ 5

Author(s):

Haiyong Bao ◽

Zhenfu Cao ◽

Shengbao Wang

Keyword(s):

Proxy Signature ◽

Signature Scheme ◽

Identity Based ◽

Threshold Proxy Signature

Download Full-text

Models of Intuitionistic Set Theories over Partial Combinatory Algebras

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/11750321_5 ◽

2006 ◽

pp. 68-78 ◽

Cited By ~ 1

Author(s):

Michael Rathjen

Download Full-text

Analyzing Chain Programs over Difference Constraints

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/11750321_16 ◽

2006 ◽

pp. 171-180

Author(s):

K. Subramani ◽

John Argentieri

Keyword(s):

Difference Constraints

Download Full-text

Identification and Comparison of Motifs in Brain-Specific and Muscle-Specific Alternative Splicing

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/11750321_46 ◽

2006 ◽

pp. 482-493 ◽

Cited By ~ 1

Author(s):

Jianning Bi ◽

Yanda Li

Keyword(s):

Alternative Splicing ◽

Specific Alternative

Download Full-text

Beyond the First Main Theorem – When Is the Solution of a Linear Cauchy Problem Computable?

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/11750321_75 ◽

2006 ◽

pp. 783-792

Author(s):

Klaus Weihrauch ◽

Ning Zhong

Keyword(s):

Cauchy Problem ◽

First Main Theorem

Download Full-text

Generalized Counters and Reversal Complexity

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/11750321_30 ◽

2006 ◽

pp. 318-326

Author(s):

M. V. Panduranga Rao

Download Full-text

Lecture Notes in Computer Science - Theory and Applications of Models of ComputationLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Optimization Problems in the Polynomial-Time Hierarchy

A Generic Set That Does Not Bound a Minimal Pair

The Trade-Off Theorem and Fragments of Gödel’s T

Improved SAT Based Bounded Model Checking

Identity-Based Threshold Proxy Signature Scheme with Known Signers

Models of Intuitionistic Set Theories over Partial Combinatory Algebras

Analyzing Chain Programs over Difference Constraints

Identification and Comparison of Motifs in Brain-Specific and Muscle-Specific Alternative Splicing

Beyond the First Main Theorem – When Is the Solution of a Linear Cauchy Problem Computable?

Generalized Counters and Reversal Complexity

Lecture Notes in Computer Science - Theory and Applications of Models of Computation
Latest Publications