000			03180nam a22003495i 4500
001			321426
003			MX-SnUAN
005			20160429161502.0
007			cr nn 008mamaa
008			160111s2015 gw | s |||| 0|eng d
020			_a9783319202976 _9978-3-319-20297-6
035			_avtls000421582
039		9	_y201601111001 _zstaff
050		4	_aQA76.9.A43
245	1	0	_aComputer science -- theory and applications : _b10th international computer science symposium in russia, csr 2015, listvyanka, russia, july 13-17, 2015, proceedings / _cedited by Lev D. Beklemishev, Daniil V. Musatov.
264		1	_aCham : _bSpringer International Publishing : _bSpringer, _c2015.
300			_axx, 443 páginas : _b66 ilustraciones
336			_atexto _btxt _2rdacontent
337			_acomputadora _bc _2rdamedia
338			_arecurso en línea _bcr _2rdacarrier
347			_aarchivo de texto _bPDF _2rda
490	0		_aLecture Notes in Computer Science, _x0302-9743 ; _v9139
500			_aSpringer eBooks
505	0		_aPropositional Proofs in Frege and Extended Frege Systems -- Circuit Complexity Meets Ontology-Based Data Access -- NEXP-Completeness and Universal Hardness Results for Justification Logic -- A Combinatorial Algorithm for the Planar Multi flow Problem with Demands Located on Three Holes -- Generalized LR Parsing for Grammars with Contexts -- On Compiling Structured CNFs to OBDDs -- Satisfiability of ECTL* with Tree Constraints -- On Growth and Fluctuation of k-Abelian Complexity -- A Polynomial-Time Algorithm for Outerplanar Diameter Improvement -- Editing to a Planar Graph of Given Degrees -- On the Satisfiability of Quantum Circuits of Small Treewidth -- Equations over Free Inverse Monoids with Idempotent Variables -- A Logical Characterization of Timed Pushdown Languages -- An In-place Priority Queue with O(1) Time for Push and lg n + O(1) Comparisons for Pop -- Resolution Complexity of Perfect Matching Principles for Sparse Graphs -- Operations on Self-verifying Finite Automata -- Automath Type Inclusion in Barendregt’s Cube -- Circuit Lower Bounds for Average-Case MA -- Making Randomness Public in Unbounded-Round Information Complexity -- First-Order Logic Definability of Free Languages -- Representation of (Left) Ideal Regular Languages by Synchronizing Automata -- Some Properties of Antistochastic Strings -- Approximation and Exact Algorithms for Special Cases of Connected f-Factors -- Rewriting Higher-Order Stack Trees -- Interacting with Modal Logics in the Coq Proof Assistant -- Delay Games with WMSOþU Winning Conditions -- Asymptotically Precise Ranking Functions for Deterministic Size-Change Systems.
590			_aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700	1		_aBeklemishev, Lev D, _eeditor. _9340656
700	1		_aMusatov, Daniil V, _eeditor. _9366406
710	2		_aSpringerLink (Servicio en línea) _9299170
776	0	8	_iEdición impresa: _z9783319202969
856	4	0	_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-319-20297-6 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942			_c14
999			_c321426 _d321426