| 000 | 06918nam a22006015i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-72504-6 | ||
| 003 | DE-He213 | ||
| 005 | 20240730183259.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 100301s2007 gw | s |||| 0|eng d | ||
| 020 |
_a9783540725046 _9978-3-540-72504-6 |
||
| 024 | 7 |
_a10.1007/978-3-540-72504-6 _2doi |
|
| 050 | 4 | _aQA75.5-76.95 | |
| 072 | 7 |
_aUYA _2bicssc |
|
| 072 | 7 |
_aCOM014000 _2bisacsh |
|
| 072 | 7 |
_aUYA _2thema |
|
| 082 | 0 | 4 |
_a004.0151 _223 |
| 245 | 1 | 0 |
_aTheory and Applications of Models of Computation _h[electronic resource] : _b4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings / _cedited by Jin-Yi Cai, Barry S. Cooper, Hong Zhu. |
| 250 | _a1st ed. 2007. | ||
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2007. |
|
| 300 |
_aXIII, 772 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v4484 |
|
| 505 | 0 | _aPlenary Lectures -- Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm -- Generalizations of the Compactness Theorem and Gödel's Completeness Theorem for Nonstandard Finite Structures -- Contributed Papers -- Approximation Algorithms for 3D Orthogonal Knapsack -- A Comparative Study of Efficient Algorithms for Partitioning a Sequence into Monotone Subsequences -- The Hardness of Selective Network Design for Bottleneck Routing Games -- A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns -- Elementary Differences Among Jump Hierarchies -- Working with the LR Degrees -- Computability on Subsets of Locally Compact Spaces -- A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs -- Finding a Duplicate and a Missing Item in a Stream -- Directed Searching Digraphs: Monotonicity and Complexity -- Protecting Against Key Escrow and Key Exposure in Identity-Based Cryptosystem -- Encapsulated Scalar Multiplications and Line Functions in the Computation of Tate Pairing -- A Provably Secure Blind Signature Scheme -- Construct Public Key Encryption Scheme Using Ergodic Matrices over GF(2) -- New Left-to-Right Radix-r Signed-Digit Recoding Algorithm for Pairing-Based Cryptosystems -- The Strongest Nonsplitting Theorem -- There is an Sw-Cuppable Strongly c.e. Real -- On Computation Complexity of the Concurrently Enabled Transition Set Problem -- Synchronization of Some DFA -- On the Treewidth and Pathwidth of Biconvex Bipartite Graphs -- On Exact Complexity of Subgraph Homeomorphism -- Searching a Polygonal Region by Two Guards -- On the Internal Steiner Tree Problem -- Approximately Optimal Trees for Group Key Management with Batch Updates -- On Deciding Deep Holes of Reed-Solomon Codes -- Quantum Multiparty Communication Complexity andCircuit Lower Bounds -- Efficient Computation of Algebraic Immunity of Symmetric Boolean Functions -- Improving the Average Delay of Sorting -- Approximating Capacitated Tree-Routings in Networks -- Feedback Arc Set Problem in Bipartite Tournaments -- Studying on Economic-Inspired Mechanisms for Routing and Forwarding in Wireless Ad Hoc Network -- Enhancing Simulation for Checking Language Containment -- QBF-Based Symbolic Model Checking for Knowledge and Time -- A Characterization of the Language Classes Learnable with Correction Queries -- Learnable Algorithm on the Continuum -- Online Deadline Scheduling with Bounded Energy Efficiency -- Efficient Algorithms for Airline Problem -- Efficient Exact Arithmetic over Constructive Reals -- Bounding Run-Times of Local Adiabatic Algorithms -- A Note on Universal Composable Zero Knowledge in Common Reference String Model -- A Note on the Feasibility of Generalized Universal Composability -- t-Private and Secure Auctions -- Secure Multiparty Computations Using a Dial Lock -- A Time Hierarchy Theorem for Nondeterministic Cellular Automata -- Decidability of Propositional Projection Temporal Logic with Infinite Models -- Separation of Data Via Concurrently Determined Discriminant Functions -- The Undecidability of the Generalized Collatz Problem -- Combinatorial and Spectral Aspects of Nearest Neighbor Graphs in Doubling Dimensional and Nearly-Euclidean Spaces -- Maximum Edge-Disjoint Paths Problem in Planar Graphs -- An Efficient Algorithm for Generating Colored Outerplanar Graphs -- Orthogonal Drawings for Plane Graphs with Specified Face Areas -- Absolutely Non-effective Predicates and Functions in Computable Analysis -- Linear-Size Log-Depth Negation-Limited Inverter for k-Tonic Binary Sequences -- The Existence of Unsatisfiable Formulas in k-LCNF fork???3 -- Improved Exponential Time Lower Bound of Knapsack Problem Under BT Model -- Phase Transition of Multivariate Polynomial Systems -- Approximation Algorithms for Maximum Edge Coloring Problem -- Two Improved Range-Efficient Algorithms for F 0 Estimation -- Approximation to the Minimum Rooted Star Cover Problem -- Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems -- Parameterized Algorithms for Weighted Matching and Packing Problems -- Kernelizations for Parameterized Counting Problems -- Revisiting the Impossibility for Boosting Service Resilience -- An Approximation Algorithm to the k-Steiner Forest Problem -- A Distributed Algorithm of Fault Recovery for Stateful Failover -- Path Embedding on Folded Hypercubes -- An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs. | |
| 650 | 0 |
_aComputer science. _99832 |
|
| 650 | 0 |
_aAlgorithms. _93390 |
|
| 650 | 0 |
_aArtificial intelligence. _93407 |
|
| 650 | 0 |
_aComputer science _xMathematics. _93866 |
|
| 650 | 0 |
_aBioinformatics. _99561 |
|
| 650 | 1 | 4 |
_aTheory of Computation. _9131305 |
| 650 | 2 | 4 |
_aAlgorithms. _93390 |
| 650 | 2 | 4 |
_aArtificial Intelligence. _93407 |
| 650 | 2 | 4 |
_aMathematics of Computing. _931875 |
| 650 | 2 | 4 |
_aBioinformatics. _99561 |
| 700 | 1 |
_aCai, Jin-Yi. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9131306 |
|
| 700 | 1 |
_aCooper, Barry S. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9131307 |
|
| 700 | 1 |
_aZhu, Hong. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9131308 |
|
| 710 | 2 |
_aSpringerLink (Online service) _9131309 |
|
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540725039 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540838272 |
| 830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v4484 _9131310 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-540-72504-6 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 942 | _cELN | ||
| 999 |
_c91777 _d91777 |
||