Filters








730 Hits in 2.4 sec

Guest Editor's Foreword

Esau McCaulley
2019 Journal for the Study of the Historical Jesus  
Editor's Foreword journal for the study of the historical jesus 17 (2019) 173-175 various quests for the historical Jesus.  ...  Therefore, the editors of jshj decided to dedicate an issue to Thurman's classic on the 70year anniversary of its publication and asked if I would be willing to serve as guest editor.  ... 
doi:10.1163/17455197-01703008 fatcat:fm3u3mttdrhangbhvwm5qkq7s4

Guest editor's foreword

Mark Overmars
1994 Discrete & Computational Geometry  
doi:10.1007/bf02574378 fatcat:psts57rnkvdptovrjujdc43xje

Guest Editor's Foreword

Valerij Dermol
2015 International Journal of Management, Knowledge and Learning  
doaj:333252bd7d6a4267adfc1be598713042 fatcat:2hoiielitnhsjam26nakjpr63q

Guest editor's foreword

Anne Condon
2004 Journal of computer and system sciences (Print)  
This special issue highlights selected contributions to the 17th Annual IEEE Conference on Computational Complexity (CCC 2002). The four works presented here describe progress on a variety of problems in complexity theory: new lower bound results both for resolution proofs as well as for circuits, strong inapproximability results for the closest vector problem on integer lattices and related problems, and new insights on amplification of the hardness of certain functions in NP. Propositional
more » ... orem proving relies strongly on application of the resolution principle, which states that an assignment satisfying clauses C3x and C 0 3 % x must also satisfy C3C 0 : In his paper "Resolution lower bounds for perfect matching principles", Alexander Razborov breaks new ground in the development of lower bounds on the length of resolution proofs. He shows that, in order to refute the assertion that a graph contains a perfect matching, any resolution proof must have size that is exponential in the ratio of the minimal degree of the graph to the square of the logarithm of the number of vertices of the graph. Actually the result is stated more generally, for hypergraphs, and has other applications to the resolution size complexity of both the counting principle and an assertion on the circuit size of a Boolean function. The latter result implies that there is no efficient resolution refutation of NPD / P=poly: In the area of circuit lower bounds, a long-standing challenge is to prove exponential lower bounds on the size of constant-depth circuits that compute the Parity function. In his contribution, "The Correlation Between Parity and Quadratic Polynomials Mod 3", Frederic Green extends the types of circuits for which such bounds are possible. He considers MAJ3MOD 3 3AND 2 circuits, which have a majority gate at the output level, fan-in 3 MOD gates in the middle, and fan-in 2 AND gates next to the input level. To show that such circuits require exponential size to compute the Parity function, he develops a new method for evaluating certain exponential sums that describe the correlation between Parity and MOD 3 3AND 2 circuits. Problems on integer lattices have received much attention recently, because of their potential in designing secure cryptographic systems and in establishing the existence of one-way functions. One such problem, the closest vector problem (CVP), is to find the point of a given integer lattice (described using a basis representation) that is closest to a given target point t: In the approximation version of this problem, the task is to find a lattice point that is within a given factor from the lattice point that is closest to t: The complexity of the approximate CVP depends on the choice of basis; therefore, it is natural to ask whether there is a choice of basis for which the CVP can be approximated arbitrarily well. In "The inapproximability of lattice and coding problems with preprocessing", Uri Feige and Daniele Miccancio show that the answer to this question is no, and that the problem is NP-hard to approximate within any factor less than ffiffiffiffiffiffiffi ffi 5=3 p ARTICLE IN PRESS
doi:10.1016/j.jcss.2004.01.005 fatcat:nwu2uqhwtngm7h7nfx5yqqd6wa

Guest editor's foreword

David Avis
1993 Discrete & Computational Geometry  
doi:10.1007/bf02573968 fatcat:a7kyk754crhwjfshcsbtuoowmq

Guest Editor's Foreword

Hee-Kap Ahn, Chan-Su Shin
2016 Algorithmica  
doi:10.1007/s00453-016-0232-x fatcat:epydgmxzkbbpvb5rybh27vimai

Guest Editor's Foreword

Marshall Bern
2000 Discrete & Computational Geometry  
doi:10.1007/s4540010079 fatcat:sihlrwe2wzddtmgh3u2pdgtq44

Guest Editor's Foreword

Kris Law
2016 International Journal of Management, Knowledge and Learning  
doaj:1854617b1cd648df8eecfa57fbc40f13 fatcat:3maxz6lbzbenxd5yc64ejyr6ny

Guest Editor's Foreword

Luka CULIBERG
2018 Asian Studies  
Luka Culiberg, Guest Editor 1 » 1 Še en kult imajo Japonci: vero Samurajev. Tej kasti pripada večina oficirjev. Ta vera je določena v častnem kodeksu Bušido.  ... 
doi:10.4312/as.2018.6.2.5-12 fatcat:6vl7ttxeoveutjpfhtbyidcghy

Guest editor's foreword

2012 Journal of Near-Death Studies  
Guest Editor's Foreword This edition of the Journal is the first of two special issues, each focused on the first annual American Center for the Integration of Spiritually Transformative Experiences (ACISTE  ... 
doi:10.17514/jnds-2012-31-2-p61-63. fatcat:krqryhw7g5cf7grkgb5yaackmm

Guest Editor's foreword

William Evans
2011 Computational geometry  
doi:10.1016/j.comgeo.2010.09.002 fatcat:cwdgen5n7ranxpuq677m22ug3y

Guest Editor's Foreword

Nick Ceramella
2012 International Journal of Language Translation and Intercultural Communication  
Guest Editor's Foreword T he essays collected in this fi rst issue of the International Journal of Language, Translation and Intercultural Communication are the result of a long and patient weaving of  ...  Nick Ceramella Guest Editor Meanwhile, I wish to acknowledge individually the invaluable expertise of them all: Gordon Senanu Kwame Adika (University of Ghana), Melissa Axelrod (University of New Mexico  ... 
doi:10.12681/ijltic.6 fatcat:bfoyum7jlja6tbch5dapvej5di

Guest Editor's Foreword

Themistocles Gogas, Theophile Munyangeyo, Neva Cebron
2015 International Journal of Language Translation and Intercultural Communication  
Guest editors' foreword In September 2013, the 13th Istanbul Biennial, titled Mom, am I Barbarian?, opened its gates.  ... 
doi:10.12681/ijltic.58 fatcat:hbhjepagkvhcdgdrxtkcujcbim

Guest Editor's Foreword

VERONICA ARNAIZ UZQUIZA, CHRISTOS STAVROU
2019 International Journal of Language Translation and Intercultural Communication  
4 Guest Editor's Foreword Audiovisual Translation appeared as a term in the academia in the 1980s and according to Gambier (1996) 'AVT has benefited from the rapid development of research interest  ... 
doi:10.12681/ijltic.20272 fatcat:aqrfa5u67vfklkqfu2nfjp3u4e

Guest Editor's Foreword

Anita Pelle
2018 International Journal of Management, Knowledge and Learning  
The guest editor hereby expresses her thanks and appreciation to the authors, the reviewers, and the journal editorship for the smooth and fruitful cooperation resulting in this volume.  ... 
doaj:805bc0d1083741188e41a67e3dc466d8 fatcat:iiszpfmzsrcebjvbnps7gfhhvi
« Previous Showing results 1 — 15 out of 730 results