HOME > 상세정보

상세정보

Fundamentals of computation theory : 8th International Conference, FCT '91, Gosen, Germany, September 9-13, 1991 : proceedings

Fundamentals of computation theory : 8th International Conference, FCT '91, Gosen, Germany, September 9-13, 1991 : proceedings

자료유형
단행본
개인저자
Budach, L. (Lothar), 1935-.
서명 / 저자사항
Fundamentals of computation theory : 8th International Conference, FCT '91, Gosen, Germany, September 9-13, 1991 : proceedings / L. Budach, ed.
발행사항
Berlin :   Springer-Verlag,   c1991.  
형태사항
xii, 426 p. : ill. ; 24 cm.
총서사항
Lecture notes in computer science ;529.
ISBN
3540544585 (Berlin : acid-free paper) 0387544585 (New York : acid-free paper)
서지주기
Includes bibliographical references.
일반주제명
Electronic data processing --Congresses. Computational complexity --Congresses.
000 01051camuuu200265 a 4500
001 000000901614
005 19981230120009.0
008 910726s1991 gw a b 10010 eng
010 ▼a 91030074
020 ▼a 3540544585 (Berlin : acid-free paper)
020 ▼a 0387544585 (New York : acid-free paper)
040 ▼a DLC ▼c DLC ▼d DLC ▼d 244002
049 0 ▼l 452087833 ▼v 529
050 0 0 ▼a QA75.5 ▼b .I573 1991
082 0 0 ▼a 004 ▼2 20
090 ▼a 004.1 ▼b L471 ▼c 529
111 2 ▼a International Conference, FCT '91 ▼n (8th : ▼d 1991 : ▼c Gosen, Brandenburg, Germany)
245 1 0 ▼a Fundamentals of computation theory : ▼b 8th International Conference, FCT '91, Gosen, Germany, September 9-13, 1991 : proceedings / ▼c L. Budach, ed.
260 ▼a Berlin : ▼b Springer-Verlag, ▼c c1991.
300 ▼a xii, 426 p. : ▼b ill. ; ▼c 24 cm.
440 0 ▼a Lecture notes in computer science ; ▼v 529.
504 ▼a Includes bibliographical references.
650 0 ▼a Electronic data processing ▼x Congresses.
650 0 ▼a Computational complexity ▼x Congresses.
700 1 ▼a Budach, L. ▼q (Lothar), ▼d 1935-.

소장정보

No. 소장처 청구기호 등록번호 도서상태 반납예정일 예약 서비스
No. 1 소장처 세종학술정보원/과학기술실/ 청구기호 004.1 L471 529 등록번호 452087833 도서상태 대출가능 반납예정일 예약 서비스 C

컨텐츠정보

목차

On strong separations from AC o.- Number theoretic algorithms and cryptology.- Computations over infinite groups.- Efficiency of Monte Carlo algorithms in numerical analysis.- Approximation algorithms for counting problems in finite fields.- Lower bounds for deterministic and nondeterministic branching programs.- Graph theoretical methods for the design of parallel algorithms.- Lattice basis reduction: Improved practical algorithms and solving subset sum problems.- Information-based complexity: Recent results and open problems.- A survey of some aspects of computational learning theory.- Recent progress in circuit and communication complexity.- The consistency of a noninterleaving and an interleaving model for full TCSP.- A geometrical bound for integer programming with polynomial constraints.- A characterization of binary search networks.- About the effect of the number of successful paths in an infinite tree on the recognizability by a finite automaton with Buchi conditions.- Deterministic dequeue automata and LL(1) parsing of breadth-depth grammars.- The complexity of computing maximal word functions.- Unambiguity and fewness for logarithmic space.- Differential resultants and subresultants.- Unifying binary-search trees and permutations.- Computational complexity and hardest languages of automata with abstract storages.- Systolic Y-tree automata: closure properties and decision problems.- A new partition lemma for planar graphs and its application to circuit complexity.- Some notes on threshold circuits, and multiplication in depth 4.- Nonlinear lower bounds on the number of processors of circuits with sublinear separators.- On space-bounded synchronized alternating turing machines.- Improving the critical density of the Lagarias-Odlyzko attack against subset sum problems.- Optimal versus stable in Boolean formulae.- The Gauß lattice basis reduction algorithm succeeds with any norm.- Regularity of one-letter languages acceptable by 2-way finite probabilistic automata.- On the semantics of atomized statements - the parallel-choice option -.- Automatic proof methods for algebraic specifications.- On the complexity of graph reconstruction.- An optimal adaptive in-place sorting algorithm.- Data structures maxima.- Average-case analysis of equality of binary trees under the BST probability model.- On the subsets of rank two in a free monoid: A fast decision algorithm.- Exact analysis of three tree contraction algorithms.- Degrees of nondeterminism for pushdown automata.- Optimal embedding of a toroidal array in a linear array.- Boolean functions with a large number of subfunctions and small complexity and depth.- Adaptive linear list reorganization for a system processing set queries.- On the decidability of integer subgraph problems on context-free graph languages.


정보제공 : Aladin

관련분야 신착자료

김자미 (2021)