Dataset Preview
The dataset viewer should be available soon. Please retry later.
paper_id string | title string | n_nodes int64 | n_edges int64 | buckets dict | acyclic bool | tier int64 | category string | json_path string | graph_path string |
|---|---|---|---|---|---|---|---|---|---|
cs_9301113v1 | Textbook examples of recursion | 100 | 23 | {
"def": 3,
"thm": 0,
"alg": 0,
"pf": 7,
"steps": 0,
"other": 90
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9301113v1_rules | render3?cat=cs_CC&id=cs_9301113v1_rules |
cs_9808001v1 | Chess Pure Strategies are Probably Chaotic | 12 | 7 | {
"def": 10,
"thm": 2,
"alg": 0,
"pf": 0,
"steps": 0,
"other": 0
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9808001v1_rules | render3?cat=cs_CC&id=cs_9808001v1_rules |
cs_9808002v1 | Downward Collapse from a Weaker Hypothesis | 38 | 28 | {
"def": 5,
"thm": 5,
"alg": 0,
"pf": 6,
"steps": 0,
"other": 22
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9808002v1_rules | render3?cat=cs_CC&id=cs_9808002v1_rules |
cs_9808003v1 | Creating Strong Total Commutative Associative Complexity-Theoretic One-Way Functions from Any Complexity-Theoretic One-Way Function | 34 | 62 | {
"def": 15,
"thm": 5,
"alg": 0,
"pf": 4,
"steps": 0,
"other": 10
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9808003v1_rules | render3?cat=cs_CC&id=cs_9808003v1_rules |
cs_9809001v1 | Immunity and Simplicity for Exact Counting and Other Counting Classes | 65 | 37 | {
"def": 20,
"thm": 14,
"alg": 0,
"pf": 10,
"steps": 0,
"other": 21
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9809001v1_rules | render3?cat=cs_CC&id=cs_9809001v1_rules |
cs_9809002v1 | Tally NP Sets and Easy Census Functions | 81 | 71 | {
"def": 24,
"thm": 22,
"alg": 0,
"pf": 12,
"steps": 0,
"other": 23
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9809002v1_rules | render3?cat=cs_CC&id=cs_9809002v1_rules |
cs_9809017v1 | The Complexity of Planar Counting Problems | 95 | 184 | {
"def": 26,
"thm": 28,
"alg": 0,
"pf": 21,
"steps": 0,
"other": 20
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9809017v1_rules | render3?cat=cs_CC&id=cs_9809017v1_rules |
cs_9809060v1 | New Applications of the Incompressibility Method: Part II | 63 | 54 | {
"def": 15,
"thm": 14,
"alg": 0,
"pf": 10,
"steps": 0,
"other": 24
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9809060v1_rules | render3?cat=cs_CC&id=cs_9809060v1_rules |
cs_9809061v1 | New Applications of the Incompressibility Method: Part I | 91 | 56 | {
"def": 17,
"thm": 11,
"alg": 0,
"pf": 8,
"steps": 0,
"other": 55
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9809061v1_rules | render3?cat=cs_CC&id=cs_9809061v1_rules |
cs_9809064v1 | Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems | 96 | 150 | {
"def": 45,
"thm": 17,
"alg": 0,
"pf": 9,
"steps": 0,
"other": 25
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9809064v1_rules | render3?cat=cs_CC&id=cs_9809064v1_rules |
cs_9809103v1 | Bicriteria Network Design Problems | 83 | 66 | {
"def": 22,
"thm": 24,
"alg": 2,
"pf": 16,
"steps": 0,
"other": 19
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9809103v1_rules | render3?cat=cs_CC&id=cs_9809103v1_rules |
cs_9809114v1 | The descriptive complexity approach to LOGCFL | 99 | 111 | {
"def": 28,
"thm": 22,
"alg": 0,
"pf": 19,
"steps": 0,
"other": 30
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9809114v1_rules | render3?cat=cs_CC&id=cs_9809114v1_rules |
cs_9809115v1 | A Generalized Quantifier Concept in Computational Complexity Theory | 142 | 160 | {
"def": 63,
"thm": 43,
"alg": 0,
"pf": 8,
"steps": 0,
"other": 28
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9809115v1_rules | render3?cat=cs_CC&id=cs_9809115v1_rules |
cs_9809116v1 | The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae | 77 | 141 | {
"def": 36,
"thm": 20,
"alg": 1,
"pf": 9,
"steps": 0,
"other": 11
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9809116v1_rules | render3?cat=cs_CC&id=cs_9809116v1_rules |
cs_9809117v2 | Hard instance generation for SAT | 67 | 61 | {
"def": 21,
"thm": 24,
"alg": 0,
"pf": 1,
"steps": 0,
"other": 21
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9809117v2_rules | render3?cat=cs_CC&id=cs_9809117v2_rules |
cs_9809118v1 | The Boolean Hierarchy over Level 1/2 of the Straubing-Therien Hierarchy | 84 | 94 | {
"def": 43,
"thm": 26,
"alg": 0,
"pf": 2,
"steps": 0,
"other": 13
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9809118v1_rules | render3?cat=cs_CC&id=cs_9809118v1_rules |
cs_9811023v1 | Complexity limitations on quantum computation | 87 | 130 | {
"def": 46,
"thm": 22,
"alg": 0,
"pf": 7,
"steps": 0,
"other": 12
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9811023v1_rules | render3?cat=cs_CC&id=cs_9811023v1_rules |
cs_9812012v1 | Quantum simulations of classical random walks and undirected graph connectivity | 55 | 47 | {
"def": 18,
"thm": 9,
"alg": 0,
"pf": 3,
"steps": 0,
"other": 25
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9812012v1_rules | render3?cat=cs_CC&id=cs_9812012v1_rules |
cs_9901015v1 | PSPACE has 2-round quantum interactive proof systems | 54 | 44 | {
"def": 24,
"thm": 3,
"alg": 0,
"pf": 1,
"steps": 0,
"other": 26
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9901015v1_rules | render3?cat=cs_CC&id=cs_9901015v1_rules |
cs_9904019v2 | Bounds for Small-Error and Zero-Error Quantum Algorithms | 74 | 76 | {
"def": 21,
"thm": 22,
"alg": 0,
"pf": 11,
"steps": 0,
"other": 20
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9904019v2_rules | render3?cat=cs_CC&id=cs_9904019v2_rules |
cs_9906008v2 | A Lower Bound on the Average-Case Complexity of Shellsort | 22 | 9 | {
"def": 1,
"thm": 3,
"alg": 0,
"pf": 3,
"steps": 0,
"other": 15
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9906008v2_rules | render3?cat=cs_CC&id=cs_9906008v2_rules |
cs_9906017v1 | Generalization of automatic sequences for numeration systems on a regular language | 49 | 75 | {
"def": 15,
"thm": 8,
"alg": 0,
"pf": 6,
"steps": 0,
"other": 20
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9906017v1_rules | render3?cat=cs_CC&id=cs_9906017v1_rules |
cs_9906028v1 | On the Power of Positive Turing Reductions | 15 | 15 | {
"def": 7,
"thm": 2,
"alg": 0,
"pf": 1,
"steps": 0,
"other": 5
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9906028v1_rules | render3?cat=cs_CC&id=cs_9906028v1_rules |
cs_9906033v1 | Robust Reductions | 94 | 68 | {
"def": 24,
"thm": 22,
"alg": 0,
"pf": 18,
"steps": 0,
"other": 30
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9906033v1_rules | render3?cat=cs_CC&id=cs_9906033v1_rules |
cs_9907033v1 | Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets | 76 | 85 | {
"def": 20,
"thm": 16,
"alg": 0,
"pf": 8,
"steps": 0,
"other": 32
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9907033v1_rules | render3?cat=cs_CC&id=cs_9907033v1_rules |
cs_9907034v1 | Polynomial-Time Multi-Selectivity | 143 | 89 | {
"def": 36,
"thm": 24,
"alg": 0,
"pf": 17,
"steps": 0,
"other": 66
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9907034v1_rules | render3?cat=cs_CC&id=cs_9907034v1_rules |
cs_9907035v1 | Easy Sets and Hard Certificate Schemes | 71 | 41 | {
"def": 25,
"thm": 7,
"alg": 0,
"pf": 12,
"steps": 0,
"other": 27
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9907035v1_rules | render3?cat=cs_CC&id=cs_9907035v1_rules |
cs_9907036v1 | Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System is Complete for Parallel Access to NP | 83 | 75 | {
"def": 28,
"thm": 10,
"alg": 0,
"pf": 8,
"steps": 0,
"other": 37
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9907036v1_rules | render3?cat=cs_CC&id=cs_9907036v1_rules |
cs_9907037v1 | Boolean Operations, Joins, and the Extended Low Hierarchy | 39 | 36 | {
"def": 13,
"thm": 9,
"alg": 0,
"pf": 6,
"steps": 0,
"other": 11
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9907037v1_rules | render3?cat=cs_CC&id=cs_9907037v1_rules |
cs_9907038v1 | A Second Step Towards Complexity-Theoretic Analogs of Rice's Theorem | 41 | 58 | {
"def": 20,
"thm": 9,
"alg": 0,
"pf": 3,
"steps": 0,
"other": 9
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9907038v1_rules | render3?cat=cs_CC&id=cs_9907038v1_rules |
cs_9907039v1 | Raising NP Lower Bounds to Parallel NP Lower Bounds | 31 | 22 | {
"def": 11,
"thm": 6,
"alg": 0,
"pf": 1,
"steps": 0,
"other": 13
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9907039v1_rules | render3?cat=cs_CC&id=cs_9907039v1_rules |
cs_9907040v1 | Characterizations of the Existence of Partial and Total One-Way Permutations | 47 | 39 | {
"def": 17,
"thm": 16,
"alg": 0,
"pf": 5,
"steps": 0,
"other": 7
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9907040v1_rules | render3?cat=cs_CC&id=cs_9907040v1_rules |
cs_9907041v1 | Restrictive Acceptance Suffices for Equivalence Problems | 37 | 35 | {
"def": 12,
"thm": 5,
"alg": 0,
"pf": 3,
"steps": 0,
"other": 17
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9907041v1_rules | render3?cat=cs_CC&id=cs_9907041v1_rules |
cs_9908018v1 | Construction of regular languages and recognizability of polynomials | 59 | 40 | {
"def": 7,
"thm": 7,
"alg": 0,
"pf": 4,
"steps": 0,
"other": 41
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9908018v1_rules | render3?cat=cs_CC&id=cs_9908018v1_rules |
cs_9909020v1 | Query Order | 61 | 56 | {
"def": 10,
"thm": 14,
"alg": 0,
"pf": 8,
"steps": 0,
"other": 29
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9909020v1_rules | render3?cat=cs_CC&id=cs_9909020v1_rules |
cs_9910001v2 | Fixed-parameter tractability, definability, and model checking | 240 | 426 | {
"def": 96,
"thm": 35,
"alg": 0,
"pf": 16,
"steps": 0,
"other": 93
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9910001v2_rules | render3?cat=cs_CC&id=cs_9910001v2_rules |
cs_9910002v1 | What's Up with Downward Collapse: Using the Easy-Hard Technique to Link Boolean and Polynomial Hierarchy Collapses | 0 | 0 | {
"def": 0,
"thm": 0,
"alg": 0,
"pf": 0,
"steps": 0,
"other": 0
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9910002v1_rules | render3?cat=cs_CC&id=cs_9910002v1_rules |
cs_9910003v1 | R_{1-tt}^{SN}(NP) Distinguishes Robust Many-One and Turing Completeness | 51 | 61 | {
"def": 15,
"thm": 16,
"alg": 0,
"pf": 6,
"steps": 0,
"other": 14
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9910003v1_rules | render3?cat=cs_CC&id=cs_9910003v1_rules |
cs_9910004v1 | An Introduction to Query Order | 24 | 12 | {
"def": 4,
"thm": 6,
"alg": 0,
"pf": 3,
"steps": 0,
"other": 11
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9910004v1_rules | render3?cat=cs_CC&id=cs_9910004v1_rules |
cs_9910005v2 | Query Order and the Polynomial Hierarchy | 63 | 81 | {
"def": 14,
"thm": 16,
"alg": 0,
"pf": 10,
"steps": 0,
"other": 23
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9910005v2_rules | render3?cat=cs_CC&id=cs_9910005v2_rules |
cs_9910006v1 | Self-Specifying Machines | 37 | 34 | {
"def": 16,
"thm": 7,
"alg": 0,
"pf": 3,
"steps": 0,
"other": 11
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9910006v1_rules | render3?cat=cs_CC&id=cs_9910006v1_rules |
cs_9910007v1 | A Downward Collapse within the Polynomial Hierarchy | 36 | 42 | {
"def": 6,
"thm": 12,
"alg": 0,
"pf": 7,
"steps": 0,
"other": 11
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9910007v1_rules | render3?cat=cs_CC&id=cs_9910007v1_rules |
cs_9910008v2 | Translating Equality Downwards | 23 | 25 | {
"def": 3,
"thm": 7,
"alg": 0,
"pf": 5,
"steps": 0,
"other": 8
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9910008v2_rules | render3?cat=cs_CC&id=cs_9910008v2_rules |
cs_9910010v2 | Communication Complexity Lower Bounds by Polynomials | 99 | 140 | {
"def": 24,
"thm": 38,
"alg": 0,
"pf": 20,
"steps": 0,
"other": 17
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9910010v2_rules | render3?cat=cs_CC&id=cs_9910010v2_rules |
cs_9911002v2 | Numeration systems on a regular language: Arithmetic operations, Recognizability and Formal power series | 209 | 198 | {
"def": 35,
"thm": 23,
"alg": 0,
"pf": 20,
"steps": 0,
"other": 130
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9911002v2_rules | render3?cat=cs_CC&id=cs_9911002v2_rules |
cs_9911004v1 | Graph Ramsey games | 120 | 120 | {
"def": 31,
"thm": 49,
"alg": 1,
"pf": 11,
"steps": 0,
"other": 28
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9911004v1_rules | render3?cat=cs_CC&id=cs_9911004v1_rules |
cs_9911007v1 | One-Way Functions in Worst-Case Cryptography: Algebraic and Security Properties | 0 | 0 | {
"def": 0,
"thm": 0,
"alg": 0,
"pf": 0,
"steps": 0,
"other": 0
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9911007v1_rules | render3?cat=cs_CC&id=cs_9911007v1_rules |
cs_9911008v1 | On quantum and classical space-bounded processes with algebraic transition amplitudes | 120 | 130 | {
"def": 42,
"thm": 16,
"alg": 0,
"pf": 8,
"steps": 0,
"other": 54
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9911008v1_rules | render3?cat=cs_CC&id=cs_9911008v1_rules |
cs_9911009v1 | Two-way finite automata with quantum and classical states | 58 | 53 | {
"def": 18,
"thm": 7,
"alg": 0,
"pf": 7,
"steps": 0,
"other": 26
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_9911009v1_rules | render3?cat=cs_CC&id=cs_9911009v1_rules |
cs_0001014v3 | Nondeterministic Quantum Query and Quantum Communication Complexities | 129 | 109 | {
"def": 54,
"thm": 24,
"alg": 0,
"pf": 12,
"steps": 0,
"other": 39
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0001014v3_rules | render3?cat=cs_CC&id=cs_0001014v3_rules |
cs_0005032v1 | Computational Complexity and Phase Transitions | 62 | 51 | {
"def": 21,
"thm": 12,
"alg": 1,
"pf": 2,
"steps": 0,
"other": 26
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0005032v1_rules | render3?cat=cs_CC&id=cs_0005032v1_rules |
cs_0007025v1 | A Moment of Perfect Clarity I: The Parallel Census Technique | 0 | 0 | {
"def": 0,
"thm": 0,
"alg": 0,
"pf": 0,
"steps": 0,
"other": 0
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0007025v1_rules | render3?cat=cs_CC&id=cs_0007025v1_rules |
cs_0008025v2 | Phutball Endgames are Hard | 8 | 8 | {
"def": 1,
"thm": 2,
"alg": 0,
"pf": 2,
"steps": 0,
"other": 3
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0008025v2_rules | render3?cat=cs_CC&id=cs_0008025v2_rules |
cs_0009002v1 | Succinct quantum proofs for properties of finite groups | 65 | 44 | {
"def": 21,
"thm": 5,
"alg": 0,
"pf": 4,
"steps": 0,
"other": 35
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0009002v1_rules | render3?cat=cs_CC&id=cs_0009002v1_rules |
cs_0010005v1 | Low Ambiguity in Strong, Total, Associative, One-Way Functions | 75 | 121 | {
"def": 19,
"thm": 13,
"alg": 0,
"pf": 9,
"steps": 0,
"other": 34
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0010005v1_rules | render3?cat=cs_CC&id=cs_0010005v1_rules |
cs_0010011v1 | If P \neq NP then Some Strongly Noninvertible Functions are Invertible | 34 | 43 | {
"def": 10,
"thm": 8,
"alg": 0,
"pf": 4,
"steps": 0,
"other": 12
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0010011v1_rules | render3?cat=cs_CC&id=cs_0010011v1_rules |
cs_0010023v1 | Oracle Complexity and Nontransitivity in Pattern Recognition | 28 | 28 | {
"def": 19,
"thm": 0,
"alg": 0,
"pf": 2,
"steps": 0,
"other": 2
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0010023v1_rules | render3?cat=cs_CC&id=cs_0010023v1_rules |
cs_0011019v1 | A Moment of Perfect Clarity II: Consequences of Sparse Sets Hard for NP with Respect to Weak Reductions | 0 | 0 | {
"def": 0,
"thm": 0,
"alg": 0,
"pf": 0,
"steps": 0,
"other": 0
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0011019v1_rules | render3?cat=cs_CC&id=cs_0011019v1_rules |
cs_0102013v5 | Quantum Multi-Prover Interactive Proof Systems with Limited Prior Entanglement | 85 | 98 | {
"def": 35,
"thm": 13,
"alg": 0,
"pf": 8,
"steps": 0,
"other": 29
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0102013v5_rules | render3?cat=cs_CC&id=cs_0102013v5_rules |
cs_0102018v1 | An effective Procedure for Speeding up Algorithms | 23 | 18 | {
"def": 14,
"thm": 3,
"alg": 0,
"pf": 0,
"steps": 0,
"other": 6
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0102018v1_rules | render3?cat=cs_CC&id=cs_0102018v1_rules |
cs_0102024v1 | P-Immune Sets with Holes Lack Self-Reducibility Properties | 27 | 33 | {
"def": 6,
"thm": 9,
"alg": 0,
"pf": 3,
"steps": 0,
"other": 9
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0102024v1_rules | render3?cat=cs_CC&id=cs_0102024v1_rules |
cs_0103021v3 | Quantum Clock Synchronization with one qubit | 16 | 14 | {
"def": 5,
"thm": 3,
"alg": 0,
"pf": 2,
"steps": 0,
"other": 6
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0103021v3_rules | render3?cat=cs_CC&id=cs_0103021v3_rules |
cs_0104015v3 | Application of Support Vector Machine to detect an association between a disease or trait and multiple SNP variations | 15 | 8 | {
"def": 5,
"thm": 0,
"alg": 0,
"pf": 0,
"steps": 0,
"other": 10
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0104015v3_rules | render3?cat=cs_CC&id=cs_0104015v3_rules |
cs_0106019v2 | Playing Games with Algorithms: Algorithmic Combinatorial Game Theory | 73 | 56 | {
"def": 52,
"thm": 2,
"alg": 0,
"pf": 0,
"steps": 0,
"other": 18
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0106019v2_rules | render3?cat=cs_CC&id=cs_0106019v2_rules |
cs_0106041v1 | Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones | 21 | 17 | {
"def": 3,
"thm": 2,
"alg": 0,
"pf": 4,
"steps": 0,
"other": 12
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0106041v1_rules | render3?cat=cs_CC&id=cs_0106041v1_rules |
cs_0106049v2 | Recursively Undecidable Properties of NP | 13 | 12 | {
"def": 5,
"thm": 1,
"alg": 0,
"pf": 5,
"steps": 0,
"other": 2
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0106049v2_rules | render3?cat=cs_CC&id=cs_0106049v2_rules |
cs_0107008v3 | Complex Tilings | 47 | 56 | {
"def": 11,
"thm": 10,
"alg": 0,
"pf": 6,
"steps": 0,
"other": 20
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0107008v3_rules | render3?cat=cs_CC&id=cs_0107008v3_rules |
cs_0107010v1 | Algorithms for Boolean Function Query Properties | 51 | 72 | {
"def": 27,
"thm": 11,
"alg": 1,
"pf": 9,
"steps": 0,
"other": 3
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0107010v1_rules | render3?cat=cs_CC&id=cs_0107010v1_rules |
cs_0107015v1 | From Neel to NPC: Colouring Small Worlds | 0 | 0 | {
"def": 0,
"thm": 0,
"alg": 0,
"pf": 0,
"steps": 0,
"other": 0
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0107015v1_rules | render3?cat=cs_CC&id=cs_0107015v1_rules |
cs_0107031v1 | The Complexity of Clickomania | 55 | 47 | {
"def": 12,
"thm": 19,
"alg": 0,
"pf": 10,
"steps": 0,
"other": 14
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0107031v1_rules | render3?cat=cs_CC&id=cs_0107031v1_rules |
cs_0108010v3 | A Note on Tiling under Tomographic Constraints | 45 | 49 | {
"def": 15,
"thm": 7,
"alg": 0,
"pf": 5,
"steps": 0,
"other": 17
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0108010v3_rules | render3?cat=cs_CC&id=cs_0108010v3_rules |
cs_0109018v1 | Exact Complexity of Exact-Four-Colorability | 21 | 38 | {
"def": 7,
"thm": 3,
"alg": 0,
"pf": 2,
"steps": 0,
"other": 9
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0109018v1_rules | render3?cat=cs_CC&id=cs_0109018v1_rules |
cs_0110005v1 | Two-way Quantum One-counter Automata | 61 | 30 | {
"def": 11,
"thm": 9,
"alg": 0,
"pf": 9,
"steps": 0,
"other": 32
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0110005v1_rules | render3?cat=cs_CC&id=cs_0110005v1_rules |
cs_0110025v2 | Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP | 66 | 81 | {
"def": 16,
"thm": 6,
"alg": 0,
"pf": 5,
"steps": 0,
"other": 39
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0110025v2_rules | render3?cat=cs_CC&id=cs_0110025v2_rules |
cs_0110038v1 | Counting is Easy | 31 | 4 | {
"def": 4,
"thm": 2,
"alg": 0,
"pf": 0,
"steps": 0,
"other": 25
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0110038v1_rules | render3?cat=cs_CC&id=cs_0110038v1_rules |
cs_0110039v1 | Two heads are better than two tapes | 35 | 12 | {
"def": 8,
"thm": 1,
"alg": 0,
"pf": 3,
"steps": 0,
"other": 23
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0110039v1_rules | render3?cat=cs_CC&id=cs_0110039v1_rules |
cs_0110040v1 | A New Approach to Formal Language Theory by Kolmogorov Complexity | 90 | 107 | {
"def": 26,
"thm": 11,
"alg": 0,
"pf": 7,
"steps": 0,
"other": 46
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0110040v1_rules | render3?cat=cs_CC&id=cs_0110040v1_rules |
cs_0110056v2 | Probabilistic analysis of a differential equation for linear programming | 242 | 146 | {
"def": 38,
"thm": 23,
"alg": 0,
"pf": 7,
"steps": 0,
"other": 174
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0110056v2_rules | render3?cat=cs_CC&id=cs_0110056v2_rules |
cs_0111052v1 | A comparison of Zeroes and Ones of a Boolean Polynomial | 48 | 56 | {
"def": 10,
"thm": 10,
"alg": 0,
"pf": 5,
"steps": 0,
"other": 23
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0111052v1_rules | render3?cat=cs_CC&id=cs_0111052v1_rules |
cs_0111053v3 | Meaningful Information | 120 | 297 | {
"def": 53,
"thm": 19,
"alg": 0,
"pf": 13,
"steps": 0,
"other": 35
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0111053v3_rules | render3?cat=cs_CC&id=cs_0111053v3_rules |
cs_0111054v3 | The similarity metric | 84 | 103 | {
"def": 29,
"thm": 10,
"alg": 0,
"pf": 6,
"steps": 0,
"other": 39
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0111054v3_rules | render3?cat=cs_CC&id=cs_0111054v3_rules |
cs_0111056v2 | Some Facets of Complexity Theory and Cryptography: A Five-Lectures Tutorial | 200 | 116 | {
"def": 46,
"thm": 16,
"alg": 1,
"pf": 7,
"steps": 0,
"other": 129
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0111056v2_rules | render3?cat=cs_CC&id=cs_0111056v2_rules |
cs_0111057v1 | Towards a characterization of the star-free sets of integers | 134 | 140 | {
"def": 42,
"thm": 13,
"alg": 0,
"pf": 9,
"steps": 0,
"other": 70
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0111057v1_rules | render3?cat=cs_CC&id=cs_0111057v1_rules |
cs_0111062v2 | One-way communication complexity and the Neciporuk lower bound on formula size | 153 | 127 | {
"def": 39,
"thm": 53,
"alg": 0,
"pf": 25,
"steps": 0,
"other": 36
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0111062v2_rules | render3?cat=cs_CC&id=cs_0111062v2_rules |
cs_0112001v9 | An Average Case NP-Complete Graph Coloring Problem | 73 | 62 | {
"def": 45,
"thm": 15,
"alg": 0,
"pf": 1,
"steps": 0,
"other": 12
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0112001v9_rules | render3?cat=cs_CC&id=cs_0112001v9_rules |
cs_0112009v1 | DNA Self-Assembly For Constructing 3D Boxes | 32 | 37 | {
"def": 13,
"thm": 5,
"alg": 0,
"pf": 5,
"steps": 0,
"other": 9
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0112009v1_rules | render3?cat=cs_CC&id=cs_0112009v1_rules |
cs_0112021v1 | Exact Complexity of the Winner Problem for Young Elections | 46 | 58 | {
"def": 20,
"thm": 5,
"alg": 0,
"pf": 5,
"steps": 0,
"other": 16
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0112021v1_rules | render3?cat=cs_CC&id=cs_0112021v1_rules |
cs_0201001v1 | Lower Bounds for Matrix Product | 116 | 102 | {
"def": 18,
"thm": 19,
"alg": 0,
"pf": 14,
"steps": 0,
"other": 65
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0201001v1_rules | render3?cat=cs_CC&id=cs_0201001v1_rules |
cs_0202036v1 | Equivalence and Isomorphism for Boolean Constraint Satisfaction | 64 | 131 | {
"def": 26,
"thm": 31,
"alg": 0,
"pf": 2,
"steps": 0,
"other": 5
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0202036v1_rules | render3?cat=cs_CC&id=cs_0202036v1_rules |
cs_0203014v1 | Active Virtual Network Management Prediction: Complexity as a Framework for Prediction, Optimization, and Assurance | 6 | 1 | {
"def": 3,
"thm": 0,
"alg": 0,
"pf": 0,
"steps": 0,
"other": 2
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0203014v1_rules | render3?cat=cs_CC&id=cs_0203014v1_rules |
cs_0203029v9 | Forbidden Information | 32 | 25 | {
"def": 23,
"thm": 7,
"alg": 0,
"pf": 1,
"steps": 0,
"other": 1
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0203029v9_rules | render3?cat=cs_CC&id=cs_0203029v9_rules |
cs_0204037v5 | Kolmogorov's Structure Functions and Model Selection | 196 | 244 | {
"def": 70,
"thm": 40,
"alg": 0,
"pf": 22,
"steps": 0,
"other": 64
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0204037v5_rules | render3?cat=cs_CC&id=cs_0204037v5_rules |
cs_0205005v5 | PSPACE-Completeness of Sliding-Block Puzzles and Other Problems through the Nondeterministic Constraint Logic Model of Computation | 68 | 100 | {
"def": 15,
"thm": 23,
"alg": 0,
"pf": 23,
"steps": 0,
"other": 7
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0205005v5_rules | render3?cat=cs_CC&id=cs_0205005v5_rules |
cs_0205031v1 | Lecture Notes on Evasiveness of Graph Properties | 167 | 165 | {
"def": 39,
"thm": 35,
"alg": 0,
"pf": 16,
"steps": 0,
"other": 77
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0205031v1_rules | render3?cat=cs_CC&id=cs_0205031v1_rules |
cs_0205035v1 | Simple Strategies for Large Zero-Sum Games with Applications to Complexity Theory | 44 | 80 | {
"def": 14,
"thm": 12,
"alg": 1,
"pf": 10,
"steps": 0,
"other": 7
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0205035v1_rules | render3?cat=cs_CC&id=cs_0205035v1_rules |
cs_0205056v1 | Parameterized Intractability of Motif Search Problems | 73 | 112 | {
"def": 22,
"thm": 16,
"alg": 0,
"pf": 13,
"steps": 0,
"other": 21
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0205056v1_rules | render3?cat=cs_CC&id=cs_0205056v1_rules |
cs_0206022v1 | The Fastest and Shortest Algorithm for All Well-Defined Problems | 32 | 21 | {
"def": 25,
"thm": 2,
"alg": 0,
"pf": 0,
"steps": 0,
"other": 5
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0206022v1_rules | render3?cat=cs_CC&id=cs_0206022v1_rules |
cs_0208006v1 | Rectangle Size Bounds and Threshold Covers in Communication Complexity | 119 | 130 | {
"def": 12,
"thm": 31,
"alg": 0,
"pf": 14,
"steps": 0,
"other": 62
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0208006v1_rules | render3?cat=cs_CC&id=cs_0208006v1_rules |
cs_0208018v2 | Does P = NP? | 1 | 0 | {
"def": 1,
"thm": 0,
"alg": 0,
"pf": 0,
"steps": 0,
"other": 0
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0208018v2_rules | render3?cat=cs_CC&id=cs_0208018v2_rules |
cs_0208026v1 | Mathematical basis for polySAT implication operator | 65 | 9 | {
"def": 43,
"thm": 1,
"alg": 0,
"pf": 0,
"steps": 0,
"other": 21
} | true | 3 | cs.CC | t3json?cat=cs_CC&id=cs_0208026v1_rules | render3?cat=cs_CC&id=cs_0208026v1_rules |
End of preview.
No dataset card yet
- Downloads last month
- 321