![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
CoRR, October 1999
- Jörg Flum, Martin Grohe:
Fixed-parameter tractability, definability, and model checking. - Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
What's Up with Downward Collapse: Using the Easy-Hard Technique to Link Boolean and Polynomial Hierarchy Collapses. - Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
R1-ttSN(NP) Distinguishes Robust Many-One and Turing Completeness. - Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
An Introduction to Query Order. - Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
Query Order and the Polynomial Hierarchy. - Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung:
Self-Specifying Machines. - Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
A Downward Collapse within the Polynomial Hierarchy. - Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
Translating Equality Downwards. - Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
Locked and Unlocked Polygonal Chains in 3D. - Harry Buhrman, Ronald de Wolf:
Communication Complexity Lower Bounds by Polynomials. - Anand Venkataraman:
A statistical model for word discovery in child directed speech. - Mark Reynolds:
The Complexity of Temporal Logic over the Reals. - Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou:
Map Graphs. - Randal E. Bryant, Steven M. German, Miroslav N. Velev:
Processor Verification Using Efficient Reductions of the Logic of Uninterpreted Functions to Propositional Logic. - Naren Ramakrishnan:
PIPE: Personalizing Recommendations via Partial Evaluation. - Jürgen Dix, Mirco Nanni, V. S. Subrahmanian:
Probabilistic Agent Programs. - Jeff Erickson:
Finite-resolution hidden surface removal. - S. Y. Wang:
Decoupling Control from Data for TCP Congestion Control. - Roberto Baldoni, Francesco Quaglia, Michel Raynal:
Consistent Checkpointing in Distributed Databases: Towards a Formal Approach. - Atsushi Fujii, Kentaro Inui, Takenobu Tokunaga, Hozumi Tanaka:
Selective Sampling for Example-based Word Sense Disambiguation. - Prasan Roy, S. Seshadri, S. Sudarshan, Siddhesh Bhobe:
Efficient and Extensible Algorithms for Multi Query Optimization. - Mark-Jan Nederhof:
Practical experiments with regular approximation of context-free languages. - Alessio Guglielmi:
A System of Interaction and Structure. - Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
On Reconfiguring Tree Linkages: Trees can Lock. - Ioannis Kontoyiannis:
Efficient sphere-covering and converse measure concentration via generalized coding theorems. - José Ignacio Farrán:
Rational points, genus and asymptotic behaviour in reduced algebraic curves over finite fields. - José Ignacio Farrán:
Decoding Algebraic Geometry codes by a key equation. - Antonio Campillo, José Ignacio Farrán:
Computing Weierstrass semigroups and the Feng-Rao distance from singular plane models. - Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn:
Polynomial method in coding and information theory. - Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg:
Geometric Thickness of Complete Graphs. - Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand:
Almost-Everywhere Superiority for Quantum Computing.
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.