DLOGTIME Proof Systems (Englisch)
Freier Zugriff
- Neue Suche nach: Krebs, Andreas
- Neue Suche nach: Limaye, Nutan
- Neue Suche nach: Krebs, Andreas
- Neue Suche nach: Limaye, Nutan
- Neue Suche nach: Seth, Anil
- Neue Suche nach: Vishnoi, Nisheeth K.
In:
LIPIcs, Volume 24, FSTTCS 2013
: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)
;
24
;
189-200
;
2013
-
ISBN:
-
ISSN:
- Aufsatz (Konferenz) / Elektronische Ressource
-
Titel:DLOGTIME Proof Systems
-
Beteiligte:Krebs, Andreas ( Autor:in ) / Limaye, Nutan ( Autor:in ) / Seth, Anil ( Herausgeber:in ) / Vishnoi, Nisheeth K. ( Herausgeber:in )
-
Erschienen in:LIPIcs, Volume 24, FSTTCS 2013 : IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013) ; 24 ; 189-200Leibniz International Proceedings in Informatics (LIPIcs) ; 24 ; 189-200
-
Verlag:
- Neue Suche nach: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
-
Erscheinungsdatum:10.12.2013
-
Format / Umfang:12 pages , 467245 byte
-
Anmerkungen:LIPIcs, Vol. 24, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013), pages 189-200
-
ISBN:
-
ISSN:
-
DOI:
-
Medientyp:Aufsatz (Konferenz)
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Schlagwörter:
-
Lizenzbestimmungen:
-
Datenquelle:
Inhaltsverzeichnis Konferenzband
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
Polar Codes: Reliable Communication with Complexity Polynomial in the Gap to Shannon Capacity (Invited Talk)Guruswami, Venkatesan et al. | 2013
- 2
-
Computing With a Fixed Number of Pointers (Invited Talk)Hofmann, Martin / Ramyaa, Ramyaa et al. | 2013
- 3
-
On Approximation Resistance of Predicates (Invited Talk)Khot, Subhash et al. | 2013
- 4
-
Characterisations of Nowhere Dense Graphs (Invited Talk)Grohe, Martin / Kreutzer, Stephan / Siebertz, Sebastian et al. | 2013
- 5
-
Intersection Types for Normalization and Verification (Invited Talk)Terui, Kazushige et al. | 2013
- 6
-
Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzik BoundCrowston, Robert / Jones, Mark / Muciaccia, Gabriele / Philip, Geevarghese / Rai, Ashutosh / Saurabh, Saket et al. | 2013
- 7
-
On the Parameterised Complexity of String Morphism ProblemsFernau, Henning / Schmid, Markus L. / Villanger, Yngve et al. | 2013
- 8
-
Partially Polynomial Kernels for Set Cover and Test CoverBasavaraju, Manu / Francis, Mathew C. / Ramanujan, M. S. / Saurabh, Saket et al. | 2013
- 9
-
Parameterized Complexity of the Anchored k-Core Problem for Directed GraphsChitnis, Rajesh / Fomin, Fedor V. / Golovach, Petr A. et al. | 2013
- 10
-
Böhm Trees as Higher-Order Recursive SchemesClairambault, Pierre / Murawski, Andrzej S. et al. | 2013
- 11
-
Evaluation is MSOL-compatibleSalvati, Sylvain / Walukiewicz, Igor et al. | 2013
- 12
-
Model Checking and Functional Program TransformationsHaddad, Axel et al. | 2013
- 13
-
A Theory of Partitioned Global Address SpacesCalin, Georgel / Derevenetc, Egor / Majumdar, Rupak / Meyer, Roland et al. | 2013
- 14
-
A Strong Direct Product Theorem for the Tribes Function via the Smooth-Rectangle BoundHarsha, Prahladh / Jain, Rahul et al. | 2013
- 15
-
Inapproximability of Rainbow ColouringChandran, L. Sunil / Rajendraprasad, Deepak et al. | 2013
- 16
-
Primal Infon Logic: Derivability in Polynomial TimeBaskar, Anguraj / Naldurg, Prasad / Raghavendra, K. R. / Suresh, S. P. et al. | 2013
- 17
-
Composition Problems for BraidsPotapov, Igor et al. | 2013
- 18
-
DLOGTIME Proof SystemsKrebs, Andreas / Limaye, Nutan et al. | 2013
- 19
-
On Improved Degree Lower Bounds for Polynomial ApproximationSrinivasan, Srikanth et al. | 2013
- 20
-
Implementing Realistic Asynchronous AutomataAkshay, S. / Dinca, Ionut / Genest, Blaise / Stefanescu, Alin et al. | 2013
- 21
-
Computation of Summaries Using Net UnfoldingsEsparza, Javier / Jezequel, Loig / Schwoon, Stefan et al. | 2013
- 22
-
Faster Deterministic Algorithms for r-Dimensional Matching Using Representative SetsGoyal, Prachi / Misra, Neeldhara / Panolan, Fahad et al. | 2013
- 23
-
Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood CoversAgarwal, Archita / Chakaravarthy, Venkatesan T. / Choudhury, Anamitra Roy / Roy, Sambuddha / Sabharwal, Yogish et al. | 2013
- 24
-
Replica Placement via Capacitated Vertex CoverArora, Sonika / Chakaravarthy, Venkatesan T. / Gupta, Neelima / Mukherjee, Koyel / Sabharwal, Yogish et al. | 2013
- 25
-
Knapsack Cover Subject to a Matroid ConstraintChakaravarthy, Venkatesan T. / Choudhury, Anamitra Roy / Natarajan, Sivaramakrishnan R. / Roy, Sambuddha et al. | 2013
- 26
-
Jumping Automata for Uniform StrategiesMaubert, Bastien / Pinchinat, Sophie et al. | 2013
- 27
-
Emptiness Of Alternating Tree Automata Using Games With Imperfect InformationFijalkow, Nathanaël / Pinchinat, Sophie / Serre, Olivier et al. | 2013
- 28
-
Saturation of Concurrent Collapsible Pushdown SystemsHague, Matthew et al. | 2013
- 29
-
Decidability Results on the Existence of Lookahead Delegators for NFALöding, Christof / Repke, Stefan et al. | 2013
- 30
-
Fair Matchings and Related ProblemsHuang, Chien-Chung / Kavitha, Telikepalli / Mehlhorn, Kurt / Michail, Dimitrios et al. | 2013
- 31
-
Ranking with Diverse Intents and Correlated ContentsLi, Jian / Zhang, Zeyu et al. | 2013
- 32
-
Separating Regular Languages by Locally Testable and Locally Threshold Testable LanguagesPlace, Thomas / van Rooijen, Lorijn / Zeitoun, Marc et al. | 2013
- 33
-
On the Structure and Complexity of Rational Sets of Regular LanguagesHolzer, Andreas / Schallhart, Christian / Tautschnig, Michael / Veith, Helmut et al. | 2013
- 34
-
Geometric Avatar ProblemsConsuegra, Mario E. / Narasimhan, Giri et al. | 2013
- 35
-
Clustering With Center ConstraintsChalermsook, Parinya / Venkatasubramanian, Suresh et al. | 2013
- 36
-
On Infinite Words Determined by Stack AutomataSmith, Tim et al. | 2013
- 37
-
The Combinatorics of Non-determinismBodini, Olivier / Genitrini, Antoine / Peschanski, Frédéric et al. | 2013
- 38
-
Renting a CloudSaha, Barna et al. | 2013
- 39
-
Energy Efficient Scheduling and Routing via Randomized RoundingBampis, Evripidis / Kononov, Alexander / Letsios, Dimitrios / Lucarelli, Giorgio / Sviridenko, Maxim et al. | 2013
- 40
-
PTAS for Ordered Instances of Resource Allocation ProblemsKhodamoradi, Kamyar / Krishnamurti, Ramesh / Rafiey, Arash / Stamoulis, Georgios et al. | 2013
- 41
-
On the Pseudoperiodic Extension of u^l = v^m w^nManea, Florin / Müller, Mike / Nowotka, Dirk et al. | 2013
- 42
-
Solvency Markov Decision Processes with InterestBrázdil, Tomás / Chen, Taolue / Forejt, Vojtech / Novotný, Petr / Simaitis, Aistis et al. | 2013
- 43
-
Parameterized Verification of Many Identical Probabilistic Timed ProcessesBertrand, Nathalie / Fournier, Paulin et al. | 2013
- 44
-
Simulation Over One-counter Nets is PSPACE-CompleteHofman, Piotr / Lasota, Slawomir / Mayr, Richard / Totzke, Patrick et al. | 2013
- 45
-
Optimal Constructions for Active DiagnosisHaar, Stefan / Haddad, Serge / Melliti, Tarek / Schwoon, Stefan et al. | 2013