On the Power of Small-Depth Computation PDF Download

Author: Emanuele Viola
Publisher: Now Publishers Inc
ISBN: 160198300X
Category : Computers
Languages : en
Pages : 84

View

Book Description
In this work we discuss selected topics on small-depth computation, presenting a few unpublished proofs along the way. The four sections contain: (1) A unified treatment of the challenge of exhibiting explicit functions that have small correlation with low-degree polynomials over {0, 1}.(2) An unpublished proof that small bounded-depth circuits (AC0) have exponentially small correlation with the parity function. The proof is due to Klivans and Vadhan; it builds upon and simplifies previous ones. (3) Valiant's simulation of log-depth linear-size circuits of fan-in 2 by sub-exponential size circuits of depth 3 and unbounded fan-in. To our knowledge, a proof of this result has never appeared in full. (4) Applebaum, Ishai, and Kushilevitz's cryptography in bounded depth.

Author: Vwani Roychowdhury
Publisher: Springer Science & Business Media
ISBN: 1461526965
Category : Computers
Languages : en
Pages : 482

View

Book Description
For any research field to have a lasting impact, there must be a firm theoretical foundation. Neural networks research is no exception. Some of the founda tional concepts, established several decades ago, led to the early promise of developing machines exhibiting intelligence. The motivation for studying such machines comes from the fact that the brain is far more efficient in visual processing and speech recognition than existing computers. Undoubtedly, neu robiological systems employ very different computational principles. The study of artificial neural networks aims at understanding these computational prin ciples and applying them in the solutions of engineering problems. Due to the recent advances in both device technology and computational science, we are currently witnessing an explosive growth in the studies of neural networks and their applications. It may take many years before we have a complete understanding about the mechanisms of neural systems. Before this ultimate goal can be achieved, an swers are needed to important fundamental questions such as (a) what can neu ral networks do that traditional computing techniques cannot, (b) how does the complexity of the network for an application relate to the complexity of that problem, and (c) how much training data are required for the resulting network to learn properly? Everyone working in the field has attempted to answer these questions, but general solutions remain elusive. However, encouraging progress in studying specific neural models has been made by researchers from various disciplines.

Author: Ding-Zhu Du
Publisher: Springer
ISBN: 303026176X
Category : Computers
Languages : en
Pages : 691

View

Book Description
This book constitutes the proceedings of the 25th International Conference on Computing and Combinatorics, COCOON 2019, held in Xi’an, China, in July 2019. The 55 papers presented in this volume were carefully reviewed and selected from 124 submissions. The papers cover various topics, including algorithm design, approximation algorithm, graph theory, complexity theory, problem solving, optimization, computational biology, computational learning, communication network, logic, and game theory.

Author: Jirí Fiala
Publisher: Springer Science & Business Media
ISBN: 3540228233
Category : Computers
Languages : en
Pages : 916

View

Book Description
This volume contains the papers presented at the 29th Symposium on Mat- matical Foundations of Computer Science, MFCS 2004, held in Prague, Czech Republic, August 22–27, 2004. The conference was organized by the Institute for Theoretical Computer Science (ITI) and the Department of Theoretical Com- terScienceandMathematicalLogic(KTIML)oftheFacultyofMathematicsand Physics of Charles University in Prague. It was supported in part by the Eu- pean Association for Theoretical Computer Science (EATCS) and the European Research Consortium for Informatics and Mathematics (ERCIM). Traditionally, the MFCS symposia encourage high-quality research in all branches of theoretical computer science. Ranging in scope from automata, f- mal languages, data structures, algorithms and computational geometry to c- plexitytheory,modelsofcomputation,andapplicationsincludingcomputational biology, cryptography, security and arti?cial intelligence, the conference o?ers a unique opportunity to researchers from diverse areas to meet and present their results to a general audience. The scienti?c program of this year’s MFCS took place in the lecture halls of the recently reconstructed building of the Faculty of Mathematics and P- sics in the historical center of Prague, with the famous Prague Castle and other celebratedhistoricalmonumentsinsight.Theviewfromthewindowswasach- lengingcompetitionforthespeakersinthe?ghtfortheattentionoftheaudience. But we did not fear the result: Due to the unusually tough competition for this year’s MFCS, the admitted presentations certainly attracted considerable in- rest. The conference program (and the proceedings) consisted of 60 contributed papers selected by the Program Committee from a total of 167 submissions.

Author: Anna Frid
Publisher: Springer Science & Business Media
ISBN: 3642033504
Category : Computers
Languages : en
Pages : 379

View

Book Description
This book constitutes the refereed proceedings of the Fourth International Computer Science Symposium in Russia, CSR 2009, held in Novosibirsk, Russia, August 18-23, 2009. The 29 revised papers presented together with 4 invited papers were carefully reviewed and selected from 66 submissions. All major areas in computer science are addressed. The theory track deals with algorithms, protocols, and data structures; complexity and cryptography; formal languages, automata and their applications to computer science; computational models and concepts; proof theory and applications of logic to computer science.

Author: Christoph Meinel
Publisher: Springer Science & Business Media
ISBN: 9783540513407
Category : Computers
Languages : en
Pages : 146

View

Book Description
Branching Programs are, besides Boolean circuits, the most important nonuniform model of computation. This volume gives a survey of the latest research in this field. It presents a branching program-based approach to complexity theory. Starting with a definition of branching programs and a review of the former research, nondeterministic branching programs are introduced and investigated, thus allowing the description of some fundamental complexity classes. The book then concentrates on the new concept of Omega-branching programs. Apart from the usual binary tests they contain features for evaluating certain elementary Boolean functions and are suited for characterizing space-bounded complexity classes. By means of these characterizations the author demonstrates the separation of some restricted complexity classes. In the appendix a number of extremely restricted graph-accessibility problems are given, which are, due to the branching program descriptions in chapters 1-3, p-projection complete in the classes under consideration.

Author: Yves Crama
Publisher: Cambridge University Press
ISBN: 0521847524
Category : Computers
Languages : en
Pages : 781

View

Book Description
A collection of papers written by prominent experts that examine a variety of advanced topics related to Boolean functions and expressions.

Author: Filip Murlak
Publisher: Springer Science & Business Media
ISBN: 3642229921
Category : Computers
Languages : en
Pages : 630

View

Book Description
This volume constitutes the refereed proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science, MFCS 2011, held in Warsaw, Poland, in August 2011. The 48 revised full papers presented together with 6 invited talks were carefully reviewed and selected from 129 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, grammars and formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, cryptography and security, databases and knowledge-based systems, formal specifications and program development, foundations of computing, logic in computer science, mobile computing, models of computation, networks, parallel and distributed computing, quantum computing, semantics and verification of programs, and theoretical issues in artificial intelligence.

Author: Anantha P. Chandrakasan
Publisher: Springer Science & Business Media
ISBN: 1461314534
Category : Technology & Engineering
Languages : en
Pages : 193

View

Book Description
Research over the last decade has brought about the development of high-performance systems such as powerful workstations, sophisticated computer graphics, and multimedia systems such as real-time video and speech recognition. A significant change in the attitude of users is the desire to have access to this computation at any location without the need to be connected to the wired power source. This has resulted in the explosive growth of research and development in the area of wireless computing over the last five years. Technologies for Wireless Computing deals with several key technologies required for wireless computing. The topics covered include reliable wireless protocols, portable terminal design considerations, video coding, RF circuit design issues and tools, display technology, energy-efficient applications, specific and programmable design techniques, energy efficiency metrics, low-voltage process technology and circuit design considerations, and CAD tools for low-power design at the behavior, logic and physical design level. Technologies for Wireless Computing is an edited volume of original research comprising invited contributions by leading researchers. This research work has also been published as a special issue of the Journal of VLSI Signal Processing Systems (Volume 13, Numbers 2 & 3).

Author: Joaquim Marques de Sá
Publisher: Springer
ISBN: 3540746900
Category : Computers
Languages : en
Pages : 999

View

Book Description
This book is the first of a two-volume set that constitutes the refereed proceedings of the 17th International Conference on Artificial Neural Networks, ICANN 2007, held in Porto, Portugal, September 2007. Coverage includes advances in neural network learning methods, advances in neural network architectures, neural dynamics and complex systems, data analysis, evolutionary computing, agents learning, as well as temporal synchronization and nonlinear dynamics in neural networks.